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 03:03Leon ZhaoLeon ZhaoScore: 26,210Success
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 03:0326,197246,479,876217,435,00002,285,568
2Aug 8, 2025 03:0326,205238,288,062216,498,0001,002,0002,285,568
3Aug 8, 2025 03:0326,206241,421,759216,507,0001,002,0002,285,568
4Aug 8, 2025 03:0326,210246,373,808216,545,0001,002,0002,285,568
5Aug 8, 2025 03:0326,210246,994,753216,540,0001,002,0002,285,568
6Aug 8, 2025 03:0326,215245,536,429217,582,00002,482,176
7Aug 8, 2025 03:0326,217248,843,789215,602,0001,996,0002,285,568
8Aug 8, 2025 03:0326,230245,393,537216,714,000998,0002,285,568
9Aug 8, 2025 03:0326,231244,302,605215,717,0001,997,0002,461,696