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 14:50Victor MerckléVictor MerckléScore: 4,590Success
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 14:514,57245,812,66036,876,0001,072,0002,113,536
2May 21, 2026 14:514,58349,168,25836,933,0001,114,0002,113,536
3May 21, 2026 14:514,58445,946,08936,985,0001,066,0002,113,536
4May 21, 2026 14:514,59045,936,17637,073,0001,029,0002,113,536
5May 21, 2026 14:514,59045,941,60137,089,0001,008,0002,113,536
6May 21, 2026 14:514,59347,540,81037,095,0001,028,0002,113,536
7May 21, 2026 14:514,59553,228,00637,104,0001,037,0002,113,536
8May 21, 2026 14:514,59745,983,55537,054,0001,102,0002,113,536
9May 21, 2026 14:514,82747,899,77638,999,0001,069,0002,113,536