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:44Victor MerckléVictor MerckléScore: 19,525Success
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:4519,479169,910,257160,535,0001,146,0002,117,632stderr
2Jul 9, 2026 18:4519,481169,544,967160,571,0001,122,0002,117,632stderr
3Jul 9, 2026 18:4519,483169,578,475160,651,0001,059,0002,117,632stderr
4Jul 9, 2026 18:4519,485169,636,576160,684,0001,047,0002,117,632stderr
5Jul 9, 2026 18:4519,525169,937,919161,000,0001,060,0002,117,632stderr
6Jul 9, 2026 18:4519,527170,023,862160,971,0001,108,0002,117,632stderr
7Jul 9, 2026 18:4519,571170,334,662161,374,0001,068,0002,117,632stderr
8Jul 9, 2026 18:4519,655171,034,324162,025,0001,112,0002,117,632stderr
9Jul 9, 2026 18:4519,698171,377,109162,363,0001,135,0002,117,632stderr