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 13, 2026 12:37Victor MerckléVictor MerckléScore: 75,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 12:3875,534637,198,193625,804,0001,135,0002,117,632stderr
2May 13, 2026 12:3875,558634,684,104626,084,0001,049,0002,117,632stderr
3May 13, 2026 12:3875,561635,724,018626,111,0001,047,0002,117,632stderr
4May 13, 2026 12:3875,582636,602,175626,257,0001,078,0002,117,632stderr
5May 13, 2026 12:3875,599635,562,372626,448,0001,025,0002,117,632stderr
6May 13, 2026 12:3875,644636,472,919626,817,0001,032,0002,117,632stderr
7May 13, 2026 12:3875,683635,565,359627,127,0001,043,0002,117,632stderr
8May 13, 2026 12:3875,780636,340,962627,905,0001,073,0002,117,632stderr
9May 13, 2026 12:3875,784636,514,548627,005,0002,004,0002,117,632stderr