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 listFeb 3, 2026 22:29RuszrokRuszrokScore: 16,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 22:2816,069156,044,006132,370,0001,002,0002,285,568
2Feb 3, 2026 22:2916,149158,501,094132,039,0002,000,0002,330,624
3Feb 3, 2026 22:2816,166160,225,197133,179,0001,001,0002,510,848
4Feb 3, 2026 22:2916,202161,193,487132,467,0002,007,0002,400,256
5Feb 3, 2026 22:2916,225159,701,818132,673,0001,995,0002,330,624
6Feb 3, 2026 22:2916,228169,463,777132,701,0001,995,0002,314,240
7Feb 3, 2026 22:2916,249162,773,760132,869,0001,998,0002,506,752
8Feb 3, 2026 22:2916,257163,998,681133,936,000999,0002,326,528
9Feb 3, 2026 22:2816,288166,116,515132,184,0003,004,0002,338,816