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 14:39Kevin HeaveyKevin HeaveyScore: 3,596Success
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 14:443,58139,377,91228,581,0001,145,0002,113,536
2Jul 18, 2026 14:443,59039,386,99228,578,0001,220,0002,113,536
3Jul 18, 2026 14:443,59241,355,41028,675,0001,139,0002,113,536
4Jul 18, 2026 14:443,59239,501,42228,624,0001,192,0002,113,536
5Jul 18, 2026 14:443,59639,402,43428,723,0001,126,0002,113,536
6Jul 18, 2026 14:443,59939,496,73728,731,0001,145,0002,113,536
7Jul 18, 2026 14:443,61239,636,23028,810,0001,177,0002,113,536
8Jul 18, 2026 14:443,62239,664,47228,873,0001,190,0002,113,536
9Jul 18, 2026 14:443,63739,872,88229,020,0001,173,0002,113,536