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 listSep 8, 2026 12:07Victor MerckléVictor MerckléScore: 6,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 12:116,52762,767,40429,335,00024,847,0002,117,632stderr
2Sep 8, 2026 12:116,57063,082,99829,537,00024,999,00024,576stderr
3Sep 8, 2026 12:116,57663,073,03729,314,00025,272,00024,576stderr
4Sep 8, 2026 12:116,61064,046,59829,243,00025,620,0002,117,632stderr
5Sep 8, 2026 12:116,63364,205,59629,447,00025,615,0002,117,632stderr
6Sep 8, 2026 12:116,65063,773,71129,613,00025,585,00024,576stderr
7Sep 8, 2026 12:116,67564,490,93129,524,00025,882,00024,576stderr
8Sep 8, 2026 12:116,71064,277,32129,821,00025,880,0002,117,632stderr
9Sep 8, 2026 12:116,71964,221,34329,670,00026,099,0002,117,632stderr