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 11, 2026 14:47caandocaandoScore: 5,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:185,04167,405,53939,852,0001,992,0002,285,568
2Mar 11, 2026 14:475,05573,309,42938,961,0002,997,0002,285,568
3Mar 10, 2026 16:185,05664,932,84339,965,0001,998,0002,285,568
4Mar 10, 2026 16:185,08164,832,92940,167,0002,008,0002,285,568
5Mar 10, 2026 16:185,08763,474,68440,211,0002,010,0002,285,568
6Mar 11, 2026 14:475,09764,027,62840,293,0002,014,0002,375,680
7Mar 10, 2026 16:185,09767,089,27541,299,0001,007,0002,285,568
8Mar 11, 2026 14:475,10664,541,52740,365,0002,018,0002,285,568
9Mar 11, 2026 14:475,11169,579,16540,400,0002,020,0002,285,568
10Mar 11, 2026 14:475,11569,813,77142,455,00002,285,568
11Mar 11, 2026 14:475,11965,053,12642,484,00002,285,568
12Mar 10, 2026 16:185,14172,092,06042,668,00002,371,584