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 09:59Tejas G.Tejas G.Score: 9,671Success
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 09:599,446100,001,12377,400,0001,005,0002,285,568
2Nov 4, 2025 09:599,448103,093,50177,410,0001,005,0002,285,568
3Nov 4, 2025 09:599,510102,328,35476,938,0001,998,0002,285,568
4Nov 4, 2025 09:599,671104,865,70879,268,0001,003,0002,285,568
5Nov 4, 2025 09:599,719110,103,24579,657,0001,008,0002,519,040
6Nov 4, 2025 09:599,732113,821,48078,779,0001,994,0002,519,040