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 20, 2026 00:51Serhii SakhnoSerhii SakhnoScore: 73,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 00:5173,512637,377,595609,153,0001,000,0002,269,184
2Feb 20, 2026 00:5173,535641,212,161609,337,0001,000,0002,289,664
3Feb 20, 2026 00:5173,566632,695,992608,599,0001,998,0002,289,664
4Feb 20, 2026 00:5173,776639,174,011610,342,0001,997,0002,523,136
5Feb 20, 2026 00:5173,820637,061,288611,709,000999,0002,514,944
6Feb 20, 2026 00:5173,861640,123,500612,047,0001,000,0002,289,664