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 21, 2026 13:14Victor MerckléVictor MerckléScore: 4,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:154,63748,234,72937,421,0001,074,0002,113,536
2May 21, 2026 13:154,63846,798,55137,443,0001,056,0002,113,536
3May 21, 2026 13:154,63948,137,36737,433,0001,076,0002,113,536
4May 21, 2026 13:154,64048,049,02737,498,0001,014,0002,113,536
5May 21, 2026 13:154,64047,746,16237,448,0001,064,0002,113,536
6May 21, 2026 13:154,65047,382,43137,518,0001,081,0002,113,536
7May 21, 2026 13:154,66646,593,54637,693,0001,036,0002,113,536
8May 21, 2026 13:154,69547,622,56637,968,0001,006,0002,113,536
9May 21, 2026 13:154,80847,750,47038,833,0001,080,0002,113,536