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 22:04Victor MerckléVictor MerckléScore: 6,796Success
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 22:056,78264,424,86755,130,0001,168,0002,117,632stderr
2Jul 6, 2026 22:056,78564,337,45655,224,0001,093,0002,117,632stderr
3Jul 6, 2026 22:056,78564,453,21455,191,0001,131,0002,117,632stderr
4Jul 6, 2026 22:056,79264,425,62355,209,0001,167,0002,117,632stderr
5Jul 6, 2026 22:056,79664,492,45255,266,0001,149,0002,117,632stderr
6Jul 6, 2026 22:056,79964,578,24655,422,0001,011,0002,117,632stderr
7Jul 6, 2026 22:056,80064,486,28355,268,0001,180,0002,117,632stderr
8Jul 6, 2026 22:056,80264,508,59255,450,0001,010,0002,117,632stderr
9Jul 6, 2026 22:056,83064,816,12855,497,0001,198,0002,117,632stderr