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 11, 2025 00:26Leon ZhaoLeon ZhaoScore: 11,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 00:2611,582121,341,95494,129,0002,002,0002,314,240
2Aug 11, 2025 00:2611,585120,491,68794,152,0002,003,0002,285,568
3Aug 11, 2025 00:2611,619120,545,17995,436,0001,004,0002,285,568
4Aug 11, 2025 00:2611,826121,816,34796,153,0002,003,0002,461,696
5Aug 11, 2025 00:2611,836129,209,43596,238,0002,004,0002,285,568
6Aug 11, 2025 00:2611,838125,802,06097,252,0001,002,0002,465,792