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 listFeb 22, 2026 09:27writemorecodewritemorecodeScore: 370,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 09:27369,0733,089,482,6142,999,341,00063,964,0002,289,664
2Feb 22, 2026 09:27369,2373,091,430,9143,003,694,00060,973,0002,293,760
3Feb 22, 2026 09:27369,3073,094,777,6663,001,287,00063,963,0002,465,792
4Feb 22, 2026 09:27369,4953,090,618,4192,985,838,00080,968,0002,367,488
5Feb 22, 2026 09:27370,1953,103,352,2892,983,656,00088,959,0002,285,568
6Feb 22, 2026 09:27370,8563,105,732,2972,999,150,00078,951,0002,293,760
7Feb 22, 2026 09:27372,8253,116,309,4993,033,481,00060,969,0002,285,568
8Feb 22, 2026 09:27374,5063,133,703,0713,044,432,00063,967,0002,285,568
9Feb 22, 2026 09:27390,0703,265,945,6653,174,612,00062,972,0002,285,568