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 7, 2026 10:09wnwnScore: 3,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:093,38040,786,18126,957,0001,097,0002,486,272
2May 7, 2026 10:093,39042,579,15727,080,0001,062,0002,486,272
3May 7, 2026 10:093,39744,448,91127,123,0001,080,0002,490,368
4May 7, 2026 10:093,40144,856,60327,137,0001,094,0002,490,368
5May 7, 2026 10:093,40244,374,43927,166,0001,076,0002,486,272
6May 7, 2026 10:093,58546,383,95728,667,0001,092,0002,494,464
7May 7, 2026 10:093,58944,025,16028,709,0001,080,0002,494,464
8May 7, 2026 10:093,59544,690,24328,678,0001,162,0002,478,080
9May 7, 2026 10:093,61545,077,08928,911,0001,098,0002,482,176