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 11, 2026 07:40wnwnScore: 3,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:403,34637,309,94026,739,0001,038,0002,113,536
2May 11, 2026 07:403,34836,893,24726,792,0001,004,0002,113,536
3May 11, 2026 07:403,37535,894,41126,980,0001,038,0002,113,536
4May 11, 2026 07:403,47937,896,09227,849,0001,032,0002,113,536
5May 11, 2026 07:403,49337,726,91227,988,0001,007,0002,113,536
6May 11, 2026 07:403,49838,731,01727,891,0001,146,0002,113,536
7May 11, 2026 07:403,49837,802,72828,002,0001,037,0002,113,536
8May 11, 2026 07:403,50839,575,51128,112,0001,005,0002,113,536
9May 11, 2026 07:403,51639,659,04628,140,0001,048,0002,113,536