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 27, 2026 01:57Kevin HeaveyKevin HeaveyScore: 4,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 01:594,17944,730,13528,305,0006,384,00020,480
2Jul 27, 2026 01:594,24245,253,68228,402,0006,812,0002,113,536
3Jul 27, 2026 01:594,27545,504,53128,305,0007,184,00020,480
4Jul 27, 2026 01:594,38546,425,24028,627,0007,776,0002,113,536
5Jul 27, 2026 01:594,50047,401,72028,901,0008,454,0002,113,536
6Jul 27, 2026 01:594,51947,637,73430,573,0006,942,0002,113,536
7Jul 27, 2026 01:594,56847,959,10130,639,0007,278,00020,480
8Jul 27, 2026 01:594,72049,749,39731,159,0008,025,00020,480
9Jul 27, 2026 01:594,81156,730,99331,184,0008,748,0002,113,536