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 listSep 24, 2026 05:18wnwnScore: 3,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:193,39536,975,69427,151,0001,035,0002,113,536
2Sep 24, 2026 05:193,41637,190,82227,355,0001,004,0002,113,536
3Sep 24, 2026 05:193,41637,157,13527,347,0001,009,0002,113,536
4Sep 24, 2026 05:193,42137,204,95927,390,0001,007,0002,113,536
5Sep 24, 2026 05:193,42537,152,34227,403,0001,026,0002,113,536
6Sep 24, 2026 05:193,58139,158,04928,714,0001,009,0002,113,536
7Sep 24, 2026 05:193,59639,271,42828,821,0001,033,0002,113,536
8Sep 24, 2026 05:193,60238,577,58928,895,0001,004,0002,113,536
9Sep 24, 2026 05:193,61439,393,94328,875,0001,123,0002,113,536