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 listAug 24, 2025 16:17Adam FolwarcznyAdam FolwarcznyScore: 22,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2025 16:1622,395207,694,111184,877,000999,0002,461,696
2Aug 24, 2025 16:1622,441209,268,406186,261,00002,285,568
3Aug 24, 2025 16:1722,449208,891,485185,328,0001,001,0002,531,328
4Aug 24, 2025 16:1622,468218,706,148186,482,00002,457,600
5Aug 24, 2025 16:1722,861218,894,537188,751,000998,0002,465,792
6Aug 24, 2025 16:1741,469364,256,221344,192,00002,453,504