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 listJun 24, 2026 18:18Victor MerckléVictor MerckléScore: 15,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:1915,050133,863,764123,796,0001,127,0002,117,632stderr
2Jun 24, 2026 18:1915,078132,779,416124,049,0001,105,0002,117,632stderr
3Jun 24, 2026 18:1915,080132,872,331124,049,0001,115,0002,117,632stderr
4Jun 24, 2026 18:1915,117133,130,696124,327,0001,147,0002,117,632stderr
5Jun 24, 2026 18:1915,147133,865,444124,720,0001,004,0002,117,632stderr
6Jun 24, 2026 18:1915,152133,429,730124,657,0001,109,0002,117,632stderr
7Jun 24, 2026 18:1915,153133,435,223124,658,0001,112,0002,117,632stderr
8Jun 24, 2026 18:1915,191133,948,480124,986,0001,102,0002,117,632stderr
9Jun 24, 2026 18:1915,201133,812,621125,063,0001,112,0002,117,632stderr