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 4, 2025 10:03Tejas G.Tejas G.Score: 9,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 10:039,525102,183,91477,058,0002,001,0002,289,664
2Nov 4, 2025 10:039,531103,085,33077,104,0002,002,0002,265,088
3Nov 4, 2025 10:039,596109,256,42879,647,00002,531,328
4Nov 4, 2025 10:039,769103,698,76779,084,0002,002,0002,289,664
5Nov 4, 2025 10:039,770103,746,24679,086,0002,002,0002,289,664
6Nov 4, 2025 10:039,795105,334,19580,292,0001,003,0002,289,664