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 20:04Victor MerckléVictor MerckléScore: 39,736Success
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 20:0539,697337,377,308328,337,0001,154,0002,117,632stderr
2Jul 6, 2026 20:0539,714337,459,729328,501,0001,133,0002,117,632stderr
3Jul 6, 2026 20:0539,731339,254,907328,770,0001,001,0002,117,632stderr
4Jul 6, 2026 20:0539,735337,712,616328,779,0001,025,0002,117,632stderr
5Jul 6, 2026 20:0539,736337,884,077328,806,0001,010,0002,117,632stderr
6Jul 6, 2026 20:0539,740337,722,629328,832,0001,013,0002,117,632stderr
7Jul 6, 2026 20:0539,749337,780,076328,782,0001,136,0002,117,632stderr
8Jul 6, 2026 20:0539,760337,977,874328,977,0001,039,0002,117,632stderr
9Jul 6, 2026 20:0539,768338,524,913329,079,0001,002,0002,117,632stderr