Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 2, 2026 03:58Josu San MartinJosu San MartinScore: 5,761Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 03:585,49472,255,69245,601,00002,293,760
2Feb 2, 2026 03:585,67266,716,41646,077,0001,001,0002,457,600
3Feb 2, 2026 03:585,67665,378,00745,110,0002,004,0002,359,296
4Feb 2, 2026 03:585,76174,552,36846,818,000996,0002,281,472
5Feb 2, 2026 03:585,80375,420,47947,161,0001,003,0002,285,568
6Feb 2, 2026 03:585,82475,224,94246,326,0002,014,0002,293,760