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 11:01caandocaandoScore: 5,641Success
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 11:015,60267,708,19645,490,0001,010,0002,260,992
2Nov 5, 2025 11:015,62274,615,51945,650,0001,014,0002,285,568
3Nov 5, 2025 11:015,62473,931,93145,663,0001,014,0002,527,232
4Nov 5, 2025 11:015,64171,249,70046,824,00002,265,088
5Nov 5, 2025 11:015,67769,722,31945,117,0002,005,0002,285,568
6Nov 5, 2025 11:015,73275,160,83246,567,0001,012,0002,523,136