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 listMay 24, 2026 19:57Maya RebholzMaya RebholzScore: 7,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:587,49173,476,69456,463,0005,713,0002,113,536
2May 24, 2026 19:587,58573,438,47757,319,0005,638,0002,113,536
3May 24, 2026 19:587,58674,882,28657,344,0005,625,0002,117,632
4May 24, 2026 19:587,59274,612,15057,424,0005,592,0002,117,632
5May 24, 2026 19:587,65375,116,70558,356,0005,171,0002,113,536
6May 24, 2026 19:587,69178,469,60957,257,0006,586,0002,117,632
7May 24, 2026 19:587,78376,980,31457,923,0006,681,0002,113,536
8May 24, 2026 19:587,85279,803,30959,277,0005,895,0002,113,536
9May 24, 2026 19:587,99881,259,17760,284,0006,104,0002,113,536