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 15:31Kevin HeaveyKevin HeaveyScore: 3,914Success
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 15:373,88941,882,23631,086,0001,200,0002,117,632
2Jul 12, 2026 15:373,90841,962,90031,155,0001,282,0002,117,632
3Jul 12, 2026 15:373,91042,050,93831,434,0001,022,0002,117,632
4Jul 12, 2026 15:373,91241,992,81331,451,0001,025,0002,117,632
5Jul 12, 2026 15:373,91442,059,95331,465,0001,028,0002,117,632
6Jul 12, 2026 15:373,93842,224,27831,673,0001,020,0002,117,632
7Jul 12, 2026 15:373,93942,278,92331,676,0001,021,0002,117,632
8Jul 12, 2026 15:373,94342,334,66631,701,0001,029,0002,117,632
9Jul 12, 2026 15:373,94342,244,65331,709,0001,025,0002,117,632