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 6, 2026 21:09Victor MerckléVictor MerckléScore: 26,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:1026,323226,619,706217,340,0001,145,0002,117,632stderr
2Jul 6, 2026 21:1026,360226,889,190217,643,0001,150,0002,117,632stderr
3Jul 6, 2026 21:1026,373227,038,262217,808,0001,095,0002,117,632stderr
4Jul 6, 2026 21:1026,374227,000,670217,793,0001,118,0002,117,632stderr
5Jul 6, 2026 21:1026,399226,998,064218,033,0001,085,0002,117,632stderr
6Jul 6, 2026 21:1026,454227,668,727218,560,0001,011,0002,117,632stderr
7Jul 6, 2026 21:1026,506228,107,294218,916,0001,091,0002,117,632stderr
8Jul 6, 2026 21:1026,506228,604,671218,845,0001,163,0002,117,632stderr
9Jul 6, 2026 21:1026,694229,688,486220,514,0001,051,0002,117,632stderr