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 listJul 22, 2026 18:07Kasper KivimäkiKasper KivimäkiScore: 58,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:0857,920491,246,660426,015,00054,721,0002,113,536
2Jul 22, 2026 18:0858,063492,475,022426,216,00055,714,0002,113,536
3Jul 22, 2026 18:0858,063492,535,670426,431,00055,496,0002,113,536
4Jul 22, 2026 18:0858,118492,866,759425,954,00056,432,0002,113,536
5Jul 22, 2026 18:0858,121492,322,702425,911,00056,495,0002,113,536
6Jul 22, 2026 18:0858,152492,594,764426,114,00056,550,0002,113,536
7Jul 22, 2026 18:0858,234493,252,719425,844,00057,503,0002,113,536
8Jul 22, 2026 18:0858,247493,413,278425,973,00057,485,0002,113,536
9Jul 22, 2026 18:0858,262494,071,869425,989,00057,586,0002,113,536