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 18:58Victor MerckléVictor MerckléScore: 3,705Success
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 18:593,67839,110,00529,496,0001,033,0002,142,208stderr
2Sep 8, 2026 18:593,67939,232,76429,493,0001,043,0002,142,208stderr
3Sep 8, 2026 18:593,69239,307,90229,600,0001,048,0002,142,208stderr
4Sep 8, 2026 18:593,69939,301,22629,671,0001,034,0002,142,208stderr
5Sep 8, 2026 18:593,70539,380,86229,719,0001,040,0002,142,208stderr
6Sep 8, 2026 18:593,74739,684,11130,071,0001,034,0002,142,208stderr
7Sep 8, 2026 18:593,75439,783,72130,124,0001,040,0002,142,208stderr
8Sep 8, 2026 18:593,77640,022,24730,308,0001,033,0002,142,208stderr
9Sep 8, 2026 18:593,80440,117,75030,532,0001,045,0002,142,208stderr