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 listApr 24, 2026 09:32Charles CabergsCharles CabergsScore: 20,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 09:3219,971187,021,952163,765,0001,997,0002,306,048
2Apr 24, 2026 09:3220,052182,787,595165,432,0001,002,0002,367,488
3Apr 24, 2026 09:3220,086179,995,190164,721,0001,996,0002,371,584
4Apr 24, 2026 09:3220,092189,139,700164,770,0001,997,0002,363,392
5Apr 24, 2026 09:3220,101182,960,525164,843,0001,998,0002,367,488
6Apr 24, 2026 09:3220,860196,953,111171,143,0002,001,0002,367,488
7Apr 24, 2026 09:3220,868192,603,736172,207,0001,001,0002,363,392
8Apr 24, 2026 09:3220,874186,576,575172,259,0001,001,0002,375,680
9Apr 24, 2026 09:3220,877193,700,350171,295,0001,991,0002,359,296