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 15, 2026 04:24Victor MerckléVictor MerckléScore: 4,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 04:274,07042,694,84432,674,0001,107,0002,117,632stderr
2Jul 15, 2026 04:274,08241,979,26632,763,0001,122,0002,117,632stderr
3Jul 15, 2026 04:274,09242,134,14032,838,0001,130,0002,117,632stderr
4Jul 15, 2026 04:274,09842,169,57132,896,0001,119,0002,117,632stderr
5Jul 15, 2026 04:274,09842,196,72132,977,0001,043,0002,117,632stderr
6Jul 15, 2026 04:274,10242,176,36433,028,0001,025,0002,117,632stderr
7Jul 15, 2026 04:274,11242,337,20433,017,0001,118,0002,117,632stderr
8Jul 15, 2026 04:274,12842,382,30933,249,0001,019,0002,117,632stderr
9Jul 15, 2026 04:274,21443,142,87233,948,0001,029,0002,117,632stderr