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 16, 2026 17:04boop34boop34Score: 9,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 17:049,19385,837,47275,299,0001,007,0002,113,536
2Jul 16, 2026 17:049,22386,736,40075,546,0001,006,0002,113,536
3Jul 16, 2026 17:049,23386,331,41775,633,0001,006,0002,113,536
4Jul 16, 2026 17:049,23586,431,09475,644,0001,008,0002,113,536
5Jul 16, 2026 17:049,23686,243,79375,657,0001,005,0002,113,536
6Jul 16, 2026 17:049,23986,370,36975,662,0001,025,0002,113,536
7Jul 16, 2026 17:049,30286,757,79476,207,0001,007,0002,113,536
8Jul 16, 2026 17:049,31086,891,37276,271,0001,009,0002,113,536
9Jul 16, 2026 17:049,76990,671,26680,076,0001,008,0002,113,536