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 2, 2026 02:30Victor MerckléVictor MerckléScore: 4,176Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 02:314,15442,312,59033,442,0001,041,0002,117,632stderr
2Jul 2, 2026 02:314,15942,448,38033,416,0001,105,0002,117,632stderr
3Jul 2, 2026 02:314,16042,275,82133,412,0001,117,0002,117,632stderr
4Jul 2, 2026 02:314,16142,434,70533,499,0001,045,0002,117,632stderr
5Jul 2, 2026 02:314,17642,421,14233,562,0001,100,0002,117,632stderr
6Jul 2, 2026 02:314,17742,434,64333,577,0001,100,0002,117,632stderr
7Jul 2, 2026 02:314,18742,589,02833,668,0001,090,0002,117,632stderr
8Jul 2, 2026 02:314,19444,702,08133,703,0001,108,0002,117,632stderr
9Jul 2, 2026 02:314,36343,999,30935,174,0001,045,0002,117,632stderr