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 8, 2025 02:53Leon ZhaoLeon ZhaoScore: 26,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 02:5326,193241,166,925216,404,0001,001,0002,285,568
2Aug 8, 2025 02:5326,198238,748,345216,439,0001,002,0002,461,696
3Aug 8, 2025 02:5326,198239,873,061217,443,00002,285,568
4Aug 8, 2025 02:5326,210242,869,021217,540,00002,465,792
5Aug 8, 2025 02:5326,213243,487,086216,564,0001,002,0002,285,568
6Aug 8, 2025 02:5326,214243,418,968216,579,000998,0002,285,568
7Aug 8, 2025 02:5326,215248,121,595217,583,00002,310,144
8Aug 8, 2025 02:5326,220242,044,320216,629,000998,0002,285,568
9Aug 8, 2025 02:5326,234245,712,281215,746,0001,997,0002,285,568