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 16:35Kevin HeaveyKevin HeaveyScore: 3,854Success
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 16:443,62539,676,83828,947,0001,146,0002,113,536
2Jul 18, 2026 16:443,63639,794,11829,023,0001,160,0002,113,536
3Jul 18, 2026 16:443,77241,081,23330,140,0001,172,0002,113,536
4Jul 18, 2026 16:443,80841,239,47030,443,0001,168,0002,113,536
5Jul 18, 2026 16:443,85442,142,04530,951,0001,041,0002,113,536
6Jul 18, 2026 16:443,86741,856,46330,926,0001,178,0002,113,536
7Jul 18, 2026 16:443,88142,429,57231,016,0001,203,0002,113,536
8Jul 18, 2026 16:443,89742,045,65231,173,0001,178,0002,113,536
9Jul 18, 2026 16:443,91842,701,05331,312,0001,212,0002,113,536