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 16, 2026 07:53wnwnScore: 3,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 07:533,96440,837,43431,901,0001,003,0002,113,536
2Jul 16, 2026 07:533,96440,821,58131,864,0001,043,0002,113,536
3Jul 16, 2026 07:533,96540,849,72531,910,0001,002,0002,113,536
4Jul 16, 2026 07:533,96740,827,51131,912,0001,017,0002,113,536
5Jul 16, 2026 07:533,96941,087,96931,903,0001,044,0002,113,536
6Jul 16, 2026 07:533,97141,063,60931,921,0001,041,0002,113,536
7Jul 16, 2026 07:533,97241,078,01331,945,0001,025,0002,113,536
8Jul 16, 2026 07:534,00241,159,83632,121,0001,100,0002,113,536
9Jul 16, 2026 07:534,11242,263,36733,134,0001,002,0002,113,536