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 9, 2026 12:37wnwnScore: 3,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:383,38545,391,25827,021,0001,079,0002,482,176
2May 9, 2026 12:383,38944,396,37727,033,0001,096,0002,486,272
3May 9, 2026 12:383,39744,309,54927,144,0001,057,0002,482,176
4May 9, 2026 12:383,40641,431,82227,203,0001,074,0002,482,176
5May 9, 2026 12:383,41944,423,64027,328,0001,050,0002,486,272
6May 9, 2026 12:383,54247,371,85328,337,0001,069,0002,486,272
7May 9, 2026 12:383,58047,532,29228,643,0001,074,0002,482,176
8May 9, 2026 12:383,58144,896,60728,673,0001,052,0002,473,984
9May 9, 2026 12:383,58447,112,47428,598,0001,151,0002,478,080