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 9, 2025 00:29Leon ZhaoLeon ZhaoScore: 16,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 00:2916,779164,076,658137,259,0002,003,0002,473,984
2Aug 9, 2025 00:2916,785166,168,536138,317,0001,002,0002,285,568
3Aug 9, 2025 00:2916,787167,205,585138,328,0001,002,0002,285,568
4Aug 9, 2025 00:2916,790172,805,528138,356,0001,002,0002,285,568
5Aug 9, 2025 00:2916,792161,858,041138,368,0001,002,0002,478,080
6Aug 9, 2025 00:2916,795160,950,479138,399,0001,002,0002,465,792
7Aug 9, 2025 00:2916,799166,231,940137,429,0002,006,0002,285,568
8Aug 9, 2025 00:2916,800164,076,165138,438,0001,003,0002,473,984
9Aug 9, 2025 00:2916,808171,772,954138,506,0001,003,0002,453,504