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:18wnwnScore: 3,521Success
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:183,37942,011,84827,010,0001,037,0002,486,272
2May 9, 2026 12:183,38444,605,64027,059,0001,035,0002,469,888
3May 9, 2026 12:183,39142,055,73027,096,0001,050,0002,482,176
4May 9, 2026 12:183,39945,350,77427,123,0001,092,0002,482,176
5May 9, 2026 12:183,52144,640,19428,152,0001,074,0002,490,368
6May 9, 2026 12:183,55143,623,06328,420,0001,055,0002,486,272
7May 9, 2026 12:183,56346,741,13428,523,0001,052,0002,482,176
8May 9, 2026 12:183,57044,582,59728,538,0001,093,0002,494,464
9May 9, 2026 12:183,58344,097,43928,698,0001,047,0002,486,272