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:55neel-bhavsarneel-bhavsarScore: 63,246Success
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:5563,032533,901,832434,459,00088,714,0002,113,536
2Sep 7, 2026 19:5563,045533,179,737434,693,00088,587,0002,113,536
3Sep 7, 2026 19:5563,171535,106,689435,220,00089,103,00020,480
4Sep 7, 2026 19:5563,211535,375,978435,165,00089,487,0002,113,536
5Sep 7, 2026 19:5563,246534,971,953436,332,00088,615,0002,113,536
6Sep 7, 2026 19:5563,249534,909,099435,863,00089,111,0002,113,536
7Sep 7, 2026 19:5563,345537,768,219436,372,00089,398,0002,113,536
8Sep 7, 2026 19:5563,362536,583,791437,227,00088,684,0002,113,536
9Sep 7, 2026 19:5563,425537,268,038436,870,00089,559,00020,480