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 18:25Victor MerckléVictor MerckléScore: 13,531Success
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 18:2713,466119,689,870110,659,0001,115,0002,117,632stderr
2Jul 9, 2026 18:2713,486119,841,657110,839,0001,097,0002,117,632stderr
3Jul 9, 2026 18:2713,498119,992,152110,929,0001,110,0002,117,632stderr
4Jul 9, 2026 18:2713,509120,012,692111,012,0001,116,0002,117,632stderr
5Jul 9, 2026 18:2713,531120,440,512111,306,0001,006,0002,117,632stderr
6Jul 9, 2026 18:2713,543120,285,766111,293,0001,122,0002,117,632stderr
7Jul 9, 2026 18:2713,543120,256,070111,374,0001,033,0002,117,632stderr
8Jul 9, 2026 18:2713,558120,339,299111,504,0001,031,0002,117,632stderr
9Jul 9, 2026 18:2713,560120,468,024111,465,0001,088,0002,117,632stderr