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 12, 2026 02:01Kevin HeaveyKevin HeaveyScore: 20,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 02:0220,238177,948,409166,845,0001,137,0002,117,632
2Jul 12, 2026 02:0220,241177,672,006166,876,0001,130,0002,117,632
3Jul 12, 2026 02:0220,245177,719,026166,883,0001,151,0002,117,632
4Jul 12, 2026 02:0220,254177,875,776166,961,0001,153,0002,117,632
5Jul 12, 2026 02:0220,257177,834,489166,980,0001,158,0002,117,632
6Jul 12, 2026 02:0220,257177,990,545166,996,0001,138,0002,117,632
7Jul 12, 2026 02:0220,257178,361,211167,000,0001,138,0002,117,632
8Jul 12, 2026 02:0220,262177,894,187167,038,0001,144,0002,117,632
9Jul 12, 2026 02:0220,265178,524,284166,947,0001,260,0002,117,632