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 15, 2026 01:55Kevin HeaveyKevin HeaveyScore: 3,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 01:563,67040,057,08829,235,0001,232,0002,117,632
2Jul 15, 2026 01:563,74640,614,91029,873,0001,224,0002,117,632
3Jul 15, 2026 01:563,91542,143,19531,270,0001,231,0002,117,632
4Jul 15, 2026 01:563,91842,078,52131,477,0001,045,0002,117,632
5Jul 15, 2026 01:563,91842,031,73131,441,0001,084,0002,117,632
6Jul 15, 2026 01:563,92042,107,91731,293,0001,245,0002,117,632
7Jul 15, 2026 01:563,92842,243,01231,564,0001,044,0002,117,632
8Jul 15, 2026 01:563,93343,475,36631,422,0001,225,0002,117,632
9Jul 15, 2026 01:563,97942,621,08131,984,0001,045,0002,117,632