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 22, 2026 08:53Victor MerckléVictor MerckléScore: 14,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:5414,254126,814,353117,246,0001,069,0002,113,536
2May 22, 2026 08:5414,256128,119,084117,276,0001,055,0002,113,536
3May 22, 2026 08:5414,258127,199,584117,291,0001,055,0002,113,536
4May 22, 2026 08:5414,270126,730,941117,384,0001,061,0002,113,536
5May 22, 2026 08:5414,289126,489,316117,540,0001,060,0002,113,536
6May 22, 2026 08:5414,290126,500,854117,537,0001,073,0002,113,536
7May 22, 2026 08:5414,298128,094,973117,651,0001,027,0002,113,536
8May 22, 2026 08:5414,311126,621,158117,754,0001,028,0002,113,536
9May 22, 2026 08:5414,411127,380,093118,545,0001,074,0002,113,536