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:33wnwnScore: 3,520Success
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:343,37944,384,40026,967,0001,083,0002,490,368
2May 7, 2026 10:343,38543,409,43527,033,0001,064,0002,490,368
3May 7, 2026 10:343,40745,135,20727,194,0001,092,0002,482,176
4May 7, 2026 10:343,41643,222,34627,272,0001,086,0002,486,272
5May 7, 2026 10:343,52043,112,80328,144,0001,080,0002,482,176
6May 7, 2026 10:343,54045,633,10228,296,0001,088,0002,486,272
7May 7, 2026 10:343,56346,103,04628,487,0001,086,0002,494,464
8May 7, 2026 10:343,58343,623,86528,610,0001,137,0002,478,080
9May 7, 2026 10:343,59746,383,28828,779,0001,079,0002,482,176