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 listNov 5, 2025 12:17caandocaandoScore: 5,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 12:175,57974,620,44944,293,0002,013,0002,265,088
2Nov 5, 2025 12:175,59571,655,40545,431,0001,009,0002,285,568
3Nov 5, 2025 12:175,61672,839,80945,602,0001,013,0002,285,568
4Nov 5, 2025 12:175,69369,246,71545,244,0002,010,0002,265,088
5Nov 5, 2025 12:175,70370,291,29245,324,0002,014,0002,285,568
6Nov 5, 2025 12:175,70572,814,31446,341,0001,007,0002,285,568