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 18, 2026 12:37Kevin HeaveyKevin HeaveyScore: 3,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:003,68940,372,06529,574,0001,046,0002,113,536
2Jul 18, 2026 13:003,79041,313,87330,418,0001,047,0002,113,536
3Jul 18, 2026 13:003,94142,430,85031,670,0001,042,0002,113,536
4Jul 18, 2026 13:003,95343,776,43931,770,0001,042,0002,113,536
5Jul 18, 2026 13:003,97242,751,44431,780,0001,188,0002,113,536
6Jul 18, 2026 13:003,98742,944,90132,054,0001,042,0002,113,536
7Jul 18, 2026 13:003,99442,983,56132,114,0001,044,0002,113,536
8Jul 18, 2026 13:004,00143,135,24332,183,0001,026,0002,113,536
9Jul 18, 2026 13:004,02850,935,19632,270,0001,163,0002,113,536