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 1, 2026 16:37Hung T.NguyenHung T.NguyenScore: 69,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:3869,299593,836,862574,187,000998,0002,383,872
2May 1, 2026 16:3869,692596,483,708576,448,0001,998,0002,383,872
3May 1, 2026 16:3869,781599,309,496578,186,0001,000,0002,383,872
4May 1, 2026 16:3869,880598,101,345578,014,0001,996,0002,387,968
5May 1, 2026 16:3869,941599,817,053578,517,0001,998,0002,310,144
6May 1, 2026 16:3869,973598,530,997578,783,0001,999,0002,367,488
7May 1, 2026 16:3870,007592,772,565580,066,0001,000,0002,383,872
8May 1, 2026 16:3870,387604,059,157582,217,0001,997,0002,318,336
9May 1, 2026 16:3870,831607,804,762585,899,0001,999,0002,387,968