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 listMay 14, 2026 07:36Victor MerckléVictor MerckléScore: 6,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 07:366,96268,274,31756,746,0001,043,0002,113,536
2May 14, 2026 07:366,96666,107,95556,796,0001,028,0002,113,536
3May 14, 2026 07:366,96667,058,52557,826,00002,113,536
4May 14, 2026 07:366,96766,109,38456,821,0001,006,0002,113,536
5May 14, 2026 07:366,98365,510,24756,918,0001,041,0002,113,536
6May 14, 2026 07:366,98866,357,85658,005,00002,113,536
7May 14, 2026 07:367,01868,083,43057,214,0001,042,0002,113,536
8May 14, 2026 07:367,02165,542,55657,277,0001,002,0002,113,536
9May 14, 2026 07:367,03266,588,20657,355,0001,012,0002,113,536