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 15, 2026 00:32Kevin HeaveyKevin HeaveyScore: 3,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 00:333,73940,595,65529,937,0001,104,0002,117,632
2Jul 15, 2026 00:333,74340,770,24329,970,0001,103,0002,117,632
3Jul 15, 2026 00:333,74540,757,08429,979,0001,106,0002,117,632
4Jul 15, 2026 00:333,74740,750,02529,987,0001,114,0002,117,632
5Jul 15, 2026 00:333,75540,825,53130,059,0001,110,0002,117,632
6Jul 15, 2026 00:333,79541,240,72830,369,0001,135,0002,117,632
7Jul 15, 2026 00:333,80741,234,82930,484,0001,115,0002,117,632
8Jul 15, 2026 00:333,83141,477,83530,689,0001,109,0002,117,632
9Jul 15, 2026 00:333,83141,475,83030,610,0001,195,0002,117,632