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 listSep 7, 2026 19:54neel-bhavsarneel-bhavsarScore: 63,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:5463,107533,844,393434,619,00089,176,00020,480
2Sep 7, 2026 19:5463,156534,928,360434,694,00089,504,00020,480
3Sep 7, 2026 19:5463,249536,192,781434,842,00090,130,00020,480
4Sep 7, 2026 19:5463,309535,410,304435,643,00089,829,00020,480
5Sep 7, 2026 19:5463,362536,566,211436,824,00089,088,00020,480
6Sep 7, 2026 19:5463,376535,980,029435,761,00090,261,00020,480
7Sep 7, 2026 19:5463,422536,306,719436,213,00090,194,00020,480
8Sep 7, 2026 19:5463,475536,874,842437,103,00089,745,00020,480
9Sep 7, 2026 19:5463,488537,044,553437,062,00089,892,00020,480