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 25, 2026 21:59Kevin HeaveyKevin HeaveyScore: 6,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 22:026,11960,814,11628,619,00022,176,0002,113,536
2Jul 25, 2026 22:026,14860,959,45728,789,00022,246,0002,113,536
3Jul 25, 2026 22:026,15661,028,19228,856,00022,239,0002,113,536
4Jul 25, 2026 22:026,20561,447,65729,235,00022,271,0002,113,536
5Jul 25, 2026 22:026,24568,844,00328,847,00022,992,0002,113,536
6Jul 25, 2026 22:026,26970,690,78829,024,00023,012,0002,113,536
7Jul 25, 2026 22:026,35962,846,03830,611,00022,173,0002,113,536
8Jul 25, 2026 22:026,39263,061,08930,854,00022,202,0002,113,536
9Jul 25, 2026 22:026,40263,162,32030,529,00022,611,0002,113,536