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 listOct 5, 2026 02:15FrederickFrederickScore: 11,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:1511,319105,097,42391,922,0002,031,0002,117,632
2Oct 5, 2026 02:1511,336104,657,10692,059,0002,036,0002,117,632
3Oct 5, 2026 02:1511,393105,047,51092,546,0002,021,0002,117,632
4Oct 5, 2026 02:1511,426106,067,21492,818,0002,022,0002,117,632
5Oct 5, 2026 02:1511,451106,285,71393,022,0002,026,0002,117,632
6Oct 5, 2026 02:1511,530108,827,41493,670,0002,029,0002,113,536
7Oct 5, 2026 02:1511,545106,998,27093,807,0002,022,0002,117,632
8Oct 5, 2026 02:1511,550106,998,71893,825,0002,046,0002,117,632
9Oct 5, 2026 02:1511,615107,504,24994,338,0002,068,0002,117,632