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 5, 2026 19:47Kevin HeaveyKevin HeaveyScore: 5,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:485,20753,402,45942,043,0001,180,0002,117,632
2Jul 5, 2026 19:485,21852,991,12142,141,0001,175,0002,117,632
3Jul 5, 2026 19:485,29853,566,96942,825,0001,156,0002,117,632
4Jul 5, 2026 19:485,30153,579,64142,833,0001,171,0002,117,632
5Jul 5, 2026 19:485,31553,767,14842,891,0001,227,0002,117,632
6Jul 5, 2026 19:485,39754,397,08243,770,0001,027,0002,117,632
7Jul 5, 2026 19:485,50455,223,51044,658,0001,026,0002,117,632
8Jul 5, 2026 19:485,51755,901,19943,701,0002,098,0002,117,632
9Jul 5, 2026 19:485,55955,845,11444,076,0002,071,0002,117,632