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 listFeb 24, 2026 13:39SneedSneedScore: 20,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 13:3919,641190,969,758161,021,0002,000,0002,273,280
2Feb 24, 2026 13:3919,654191,406,323162,128,0001,000,0002,285,568
3Feb 24, 2026 13:3919,656187,241,799162,143,0001,000,0002,523,136
4Feb 24, 2026 13:3919,660196,603,791163,177,00002,285,568
5Feb 24, 2026 13:3920,330197,268,921167,740,000998,0002,285,568
6Feb 24, 2026 13:3920,330194,309,896168,740,00002,285,568
7Feb 24, 2026 13:3920,339194,103,270167,814,000998,0002,285,568
8Feb 24, 2026 13:3920,342192,284,865166,844,0001,998,0002,285,568
9Feb 24, 2026 13:3920,345194,524,684167,867,000999,0002,285,568