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 listNov 4, 2025 04:14Tejas G.Tejas G.Score: 7,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:147,92490,244,82263,780,0001,993,0002,277,376
2Nov 4, 2025 04:147,92691,708,99264,787,000996,0002,285,568
3Nov 4, 2025 04:147,92691,465,48065,784,00002,285,568
4Nov 4, 2025 04:147,92790,539,17064,786,0001,012,0002,285,568
5Nov 4, 2025 04:147,93090,354,61163,821,0001,994,0002,285,568
6Nov 4, 2025 04:147,93789,062,74863,877,0001,996,0002,265,088
7Nov 4, 2025 04:147,97995,545,98964,219,0002,006,0002,285,568
8Nov 4, 2025 04:147,98993,606,01264,299,0002,009,0002,265,088
9Nov 4, 2025 04:148,02793,426,18165,619,0001,009,0002,285,568
10Nov 4, 2025 04:148,07892,559,86465,044,0002,001,0002,285,568
11Nov 4, 2025 04:148,08995,335,68965,134,0002,004,0002,285,568
12Nov 4, 2025 04:148,15497,982,16866,669,0001,010,0002,285,568