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 10:22Victor MerckléVictor MerckléScore: 68,846Success
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 10:2368,310575,015,129565,903,0001,070,0002,117,632stderr
2Jul 9, 2026 10:2368,328575,191,058566,041,0001,085,0002,117,632stderr
3Jul 9, 2026 10:2368,422575,964,869566,825,0001,082,0002,117,632stderr
4Jul 9, 2026 10:2368,688578,192,854569,010,0001,107,0002,117,632stderr
5Jul 9, 2026 10:2368,846579,540,789570,429,0001,000,0002,117,632stderr
6Jul 9, 2026 10:2368,918579,873,499570,921,0001,100,0002,117,632stderr
7Jul 9, 2026 10:2369,303583,339,358574,085,0001,135,0002,117,632stderr
8Jul 9, 2026 10:2369,821587,644,035578,503,0001,013,0002,117,632stderr
9Jul 9, 2026 10:2370,108590,070,695580,885,0001,015,0002,117,632stderr