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 4, 2026 11:26limanjun99limanjun99Score: 4,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 11:294,44555,380,67534,651,0002,250,0002,510,848
2May 4, 2026 11:294,45655,149,77434,643,0002,345,0002,498,560
3May 4, 2026 11:294,45655,768,62734,696,0002,297,0002,498,560
4May 4, 2026 11:294,46855,234,37434,805,0002,287,0002,510,848
5May 4, 2026 11:294,51754,723,03335,215,0002,284,0002,502,656
6May 4, 2026 11:294,52654,118,75635,310,0002,257,0002,506,752
7May 4, 2026 11:294,54456,007,39435,446,0002,276,0002,510,848
8May 4, 2026 11:294,57158,383,11535,581,0002,366,0002,490,368
9May 4, 2026 11:294,59554,027,11934,506,0003,635,0002,494,464