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 18, 2026 15:15Kevin HeaveyKevin HeaveyScore: 3,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 15:183,59439,444,34328,663,0001,172,0002,113,536
2Jul 18, 2026 15:183,59639,493,30528,718,0001,134,0002,113,536
3Jul 18, 2026 15:183,60939,598,48528,759,0001,198,0002,113,536
4Jul 18, 2026 15:183,60939,630,73328,813,0001,149,0002,113,536
5Jul 18, 2026 15:183,77740,974,05230,192,0001,162,0002,113,536
6Jul 18, 2026 15:183,78441,072,80030,247,0001,168,0002,113,536
7Jul 18, 2026 15:183,79341,160,02930,298,0001,190,0002,113,536
8Jul 18, 2026 15:183,90842,109,87231,288,0001,151,0002,113,536
9Jul 18, 2026 15:183,92342,805,38431,397,0001,167,0002,113,536