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:19Tejas G.Tejas G.Score: 7,846Success
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:197,80694,574,93263,794,000996,0002,285,568
2Nov 4, 2025 04:197,81486,364,76162,865,0001,995,0002,260,992
3Nov 4, 2025 04:197,81786,259,06762,885,0001,996,0002,285,568
4Nov 4, 2025 04:197,82391,778,52562,932,0001,997,0002,367,488
5Nov 4, 2025 04:197,82392,383,41762,934,0001,997,0002,285,568
6Nov 4, 2025 04:197,82690,271,10062,958,0001,998,0002,510,848
7Nov 4, 2025 04:197,84693,623,99263,116,0002,003,0002,260,992
8Nov 4, 2025 04:197,85193,513,15264,160,0001,002,0002,285,568
9Nov 4, 2025 04:197,88691,859,66764,450,0001,007,0002,285,568
10Nov 4, 2025 04:197,97387,595,36864,171,0002,005,0002,265,088
11Nov 4, 2025 04:197,98288,865,02764,243,0002,007,0002,285,568
12Nov 4, 2025 04:198,06194,153,66365,907,000998,0002,285,568