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 19, 2026 13:04Victor MerckléVictor MerckléScore: 5,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 13:055,95059,246,83248,371,0001,021,0002,113,536
2May 19, 2026 13:055,95357,215,59148,399,0001,014,0002,113,536
3May 19, 2026 13:055,95857,227,16648,433,0001,024,0002,113,536
4May 19, 2026 13:055,96057,715,33048,454,0001,017,0002,113,536
5May 19, 2026 13:055,96257,258,89148,459,0001,026,0002,113,536
6May 19, 2026 13:056,01959,551,37848,933,0001,027,0002,113,536
7May 19, 2026 13:056,05360,358,74349,211,0001,033,0002,113,536
8May 19, 2026 13:056,06658,079,95049,323,0001,029,0002,113,536
9May 19, 2026 13:056,14960,411,69550,016,0001,024,0002,113,536