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 18, 2025 22:31Leon ZhaoLeon ZhaoScore: 11,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 22:3111,356118,252,50092,252,0002,005,0002,285,568
2Aug 18, 2025 22:3111,363123,797,78492,304,0002,006,0002,285,568
3Aug 18, 2025 22:3111,378117,831,60293,442,000994,0002,285,568
4Aug 18, 2025 22:3111,670126,984,38594,860,0001,997,0002,285,568
5Aug 18, 2025 22:3111,677124,707,53894,919,0001,998,0002,285,568
6Aug 18, 2025 22:3111,683125,589,91695,966,000999,0002,453,504