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 listMar 6, 2026 17:36Josu San MartinJosu San MartinScore: 5,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 17:365,12768,389,27941,539,0001,013,0002,334,720
2Mar 6, 2026 17:365,12965,419,30741,554,0001,013,0002,326,528
3Mar 6, 2026 17:365,23765,925,81943,466,00002,330,624
4Mar 6, 2026 17:365,28074,684,96943,828,00002,330,624
5Mar 6, 2026 17:365,28068,762,41343,822,00002,342,912
6Mar 6, 2026 17:365,35664,043,62044,457,00002,326,528