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 listMar 2, 2026 10:20Priyansh RathiPriyansh RathiScore: 370,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 10:20368,7803,089,287,1393,003,896,00056,979,0002,293,760
2Mar 2, 2026 10:20368,8083,087,100,9133,012,138,00048,969,0002,289,664
3Mar 2, 2026 10:20370,1343,093,682,3992,995,164,00076,952,0002,285,568
4Mar 2, 2026 10:20370,8063,101,819,3022,998,722,00078,966,0002,285,568
5Mar 2, 2026 10:20370,9493,105,492,1663,001,904,00076,971,0002,285,568
6Mar 2, 2026 10:20371,8433,113,816,9573,027,333,00058,967,0002,293,760
7Mar 2, 2026 10:20373,6823,125,511,8683,049,587,00051,975,0002,363,392
8Mar 2, 2026 10:20375,0053,137,619,9553,053,566,00058,972,0002,285,568
9Mar 2, 2026 10:20385,6333,224,848,3183,141,781,00058,977,0002,285,568