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 30, 2026 09:03Victor MerckléVictor MerckléScore: 11,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 09:0411,01899,331,51090,334,0001,121,0002,117,632stderr
2Jun 30, 2026 09:0411,03899,498,01090,500,0001,117,0002,117,632stderr
3Jun 30, 2026 09:0411,07799,880,40190,818,0001,128,0002,117,632stderr
4Jun 30, 2026 09:0411,09499,928,48891,048,0001,039,0002,117,632stderr
5Jun 30, 2026 09:0411,110100,135,15991,179,0001,035,0002,117,632stderr
6Jun 30, 2026 09:0411,117100,180,66091,234,0001,039,0002,117,632stderr
7Jun 30, 2026 09:0411,233101,104,85892,143,0001,093,0002,117,632stderr
8Jun 30, 2026 09:0411,257101,653,48692,436,0001,002,0002,117,632stderr
9Jun 30, 2026 09:0411,268101,722,13592,493,0001,039,0002,117,632stderr