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 listMay 13, 2026 17:16Victor MerckléVictor MerckléScore: 71,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:1771,476602,349,268592,109,0001,147,0002,117,632stderr
2May 13, 2026 17:1771,564603,254,794592,811,0001,172,0002,117,632stderr
3May 13, 2026 17:1771,596602,300,820593,245,0001,002,0002,117,632stderr
4May 13, 2026 17:1771,637602,303,883593,587,0001,005,0002,117,632stderr
5May 13, 2026 17:1771,679604,657,407593,941,0001,001,0002,117,632stderr
6May 13, 2026 17:1771,691604,498,874593,891,0001,150,0002,117,632stderr
7May 13, 2026 17:1771,705602,510,490594,100,0001,056,0002,117,632stderr
8May 13, 2026 17:1772,126609,475,041597,429,0001,218,0002,117,632stderr
9May 13, 2026 17:1772,268609,123,685598,748,0001,082,0002,117,632stderr