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 14, 2026 21:31Kevin HeaveyKevin HeaveyScore: 3,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:333,69040,278,50729,611,0001,024,0002,117,632
2Jul 14, 2026 21:333,69440,282,19829,646,0001,020,0002,117,632
3Jul 14, 2026 21:333,70040,301,37729,687,0001,026,0002,117,632
4Jul 14, 2026 21:333,70740,387,15129,744,0001,025,0002,117,632
5Jul 14, 2026 21:333,71140,517,75829,781,0001,028,0002,117,632
6Jul 14, 2026 21:333,76140,846,03630,182,0001,041,0002,117,632
7Jul 14, 2026 21:333,77840,927,49030,318,0001,044,0002,117,632
8Jul 14, 2026 21:333,79541,088,73230,453,0001,046,0002,117,632
9Jul 14, 2026 21:333,79741,106,31930,476,0001,044,0002,117,632