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 listMay 10, 2026 11:14wnwnScore: 3,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:143,38342,247,11727,053,0001,030,0002,482,176
2May 10, 2026 11:143,38345,083,95127,031,0001,051,0002,490,368
3May 10, 2026 11:143,42142,803,00327,350,0001,049,0002,482,176
4May 10, 2026 11:143,52344,145,14728,167,0001,076,0002,490,368
5May 10, 2026 11:143,54044,880,92528,334,0001,052,0002,494,464
6May 10, 2026 11:143,55146,571,30628,370,0001,105,0002,486,272
7May 10, 2026 11:143,58042,074,35528,635,0001,079,0002,486,272
8May 10, 2026 11:143,58645,697,19228,684,0001,085,0002,494,464
9May 10, 2026 11:143,58644,925,86828,662,0001,107,0002,490,368