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 listJul 9, 2026 19:26Victor MerckléVictor MerckléScore: 25,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 19:2725,432221,013,390210,074,0001,017,0002,117,632stderr
2Jul 9, 2026 19:2725,438219,075,028210,111,0001,026,0002,117,632stderr
3Jul 9, 2026 19:2725,452219,164,527210,152,0001,103,0002,117,632stderr
4Jul 9, 2026 19:2725,457219,246,002210,182,0001,114,0002,117,632stderr
5Jul 9, 2026 19:2725,463219,644,565210,233,0001,110,0002,117,632stderr
6Jul 9, 2026 19:2725,466219,346,853210,245,0001,127,0002,117,632stderr
7Jul 9, 2026 19:2725,478219,312,229210,425,0001,043,0002,117,632stderr
8Jul 9, 2026 19:2725,498219,613,753210,640,0001,001,0002,117,632stderr
9Jul 9, 2026 19:2725,753221,840,340212,696,0001,057,0002,117,632stderr