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:19Leon ZhaoLeon ZhaoScore: 17,141Success
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:1917,139164,564,170141,251,0001,001,0002,285,568
2Aug 9, 2025 00:1917,139169,365,567140,254,0002,003,0002,297,856
3Aug 9, 2025 00:1917,140164,758,850140,260,0002,003,0002,469,888
4Aug 9, 2025 00:1917,141166,726,873140,264,0002,003,0002,285,568
5Aug 9, 2025 00:1917,141170,942,359140,264,0002,003,0002,469,888
6Aug 9, 2025 00:1917,145169,033,327140,299,0002,004,0002,465,792
7Aug 9, 2025 00:1917,155169,573,770140,383,0002,005,0002,457,600
8Aug 9, 2025 00:1917,165170,314,441141,470,0001,003,0002,285,568
9Aug 9, 2025 00:1917,170177,089,607141,510,0001,003,0002,285,568