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 23, 2026 14:35Victor MerckléVictor MerckléScore: 11,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 14:3611,322101,633,42392,867,0001,112,0002,117,632stderr
2Jun 23, 2026 14:3611,331101,487,11192,955,0001,097,0002,117,632stderr
3Jun 23, 2026 14:3611,342102,125,74393,130,0001,011,0002,117,632stderr
4Jun 23, 2026 14:3611,344101,759,79093,064,0001,096,0002,117,632stderr
5Jun 23, 2026 14:3611,349102,562,64293,095,0001,106,0002,117,632stderr
6Jun 23, 2026 14:3611,365102,032,82093,224,0001,109,0002,117,632stderr
7Jun 23, 2026 14:3611,519103,330,12994,579,0001,035,0002,117,632stderr
8Jun 23, 2026 14:3611,543103,523,55994,723,0001,089,0002,117,632stderr
9Jun 23, 2026 14:3611,548103,489,17594,761,0001,095,0002,117,632stderr