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 listFeb 16, 2026 09:51tch1001tch1001Score: 70,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 09:5170,151606,791,014581,254,0001,000,0002,273,280
2Feb 16, 2026 09:5170,161607,159,921581,333,0001,000,0002,273,280
3Feb 16, 2026 09:5170,162608,552,016581,344,0001,000,0002,273,280
4Feb 16, 2026 09:5170,182612,258,405581,513,000999,0002,396,160
5Feb 16, 2026 09:5170,182610,847,888581,515,000999,0002,273,280
6Feb 16, 2026 09:5170,186612,122,313581,545,000999,0002,273,280
7Feb 16, 2026 09:5170,188614,675,165580,562,0001,998,0002,400,256
8Feb 16, 2026 09:5170,204612,758,636579,698,0002,998,0002,273,280
9Feb 16, 2026 09:5170,296618,265,727581,459,0001,998,0002,273,280