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 14, 2026 21:19Victor MerckléVictor MerckléScore: 56,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 21:2056,540476,815,531468,282,0001,004,0002,117,632stderr
2May 14, 2026 21:2056,545478,955,049468,324,0001,005,0002,117,632stderr
3May 14, 2026 21:2056,558479,849,637468,396,0001,038,0002,117,632stderr
4May 14, 2026 21:2056,559477,032,192468,441,0001,003,0002,117,632stderr
5May 14, 2026 21:2056,566478,593,556468,498,0001,003,0002,117,632stderr
6May 14, 2026 21:2056,566477,291,372468,502,0001,003,0002,117,632stderr
7May 14, 2026 21:2056,570479,872,015468,529,0001,003,0002,117,632stderr
8May 14, 2026 21:2056,574479,931,472468,562,0001,003,0002,121,728stderr
9May 14, 2026 21:2056,592479,609,050468,710,0001,004,0002,117,632stderr