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 14, 2026 14:13Mikołaj UzarskiMikołaj UzarskiScore: 5,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 14:135,09865,134,33641,310,0001,007,0002,285,568
2Mar 14, 2026 14:135,10169,734,60939,313,0003,024,0002,285,568
3Mar 14, 2026 14:135,10363,439,70640,340,0002,017,0002,502,656
4Mar 14, 2026 14:135,10764,320,77141,381,0001,009,0002,277,376
5Mar 14, 2026 14:135,11065,116,79541,404,0001,009,0002,514,944
6Mar 14, 2026 14:135,11367,683,73540,414,0002,020,0002,506,752
7Mar 14, 2026 14:135,11965,161,93242,487,00002,285,568
8Mar 14, 2026 14:135,12364,863,92241,509,0001,012,0002,506,752
9Mar 14, 2026 14:135,14066,802,64641,649,0001,015,0002,277,376