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 27, 2026 01:58Kevin HeaveyKevin HeaveyScore: 4,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 02:004,03443,573,26129,396,0004,090,0002,113,536
2Jul 27, 2026 02:004,34646,125,96131,843,0004,234,0002,113,536
3Jul 27, 2026 02:004,45347,063,72430,840,0006,120,0002,113,536
4Jul 27, 2026 02:004,51147,561,80131,313,0006,130,0002,113,536
5Jul 27, 2026 02:004,51347,578,09631,255,0006,203,0002,113,536
6Jul 27, 2026 02:004,63348,535,85331,473,0006,984,0002,113,536
7Jul 27, 2026 02:004,68648,919,60231,664,0007,231,0002,113,536
8Jul 27, 2026 02:004,74349,412,41631,807,0007,566,0002,113,536
9Jul 27, 2026 02:004,87150,529,28630,295,00010,135,00020,480