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 listJun 26, 2026 11:51Victor MerckléVictor MerckléScore: 5,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 11:534,91748,317,09839,804,0001,013,0002,113,536
2Jun 26, 2026 11:535,01349,254,72740,608,0001,002,0002,113,536
3Jun 26, 2026 11:535,02749,282,92840,686,0001,041,0002,113,536
4Jun 26, 2026 11:535,09449,853,67141,244,0001,041,0002,113,536
5Jun 26, 2026 11:535,09549,735,40641,262,0001,027,0002,113,536
6Jun 26, 2026 11:535,10049,953,30241,308,0001,027,0002,113,536
7Jun 26, 2026 11:535,11649,988,55041,460,0001,011,0002,113,536
8Jun 26, 2026 11:535,15450,453,91941,757,0001,025,0002,113,536
9Jun 26, 2026 11:535,31451,640,39743,084,0001,027,0002,113,536