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 23, 2026 12:04Kevin HeaveyKevin HeaveyScore: 3,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 12:073,19935,142,34726,559,000020,480
2Sep 23, 2026 12:073,20735,214,59725,612,0001,008,00020,480
3Sep 23, 2026 12:073,20735,175,52125,619,0001,004,00020,480
4Sep 23, 2026 12:073,20835,246,24525,593,0001,036,00020,480
5Sep 23, 2026 12:073,20935,220,50725,630,0001,008,00020,480
6Sep 23, 2026 12:073,20935,264,72525,604,0001,035,00020,480
7Sep 23, 2026 12:073,21135,256,49925,647,0001,010,00020,480
8Sep 23, 2026 12:073,21235,289,76925,636,0001,026,00020,480
9Sep 23, 2026 12:073,21335,272,81825,637,0001,036,00020,480