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 17:41caandocaandoScore: 6,035Success
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 17:415,92769,519,26747,190,0002,008,0002,387,968
2Nov 4, 2025 17:415,95576,399,50948,419,0001,008,0002,285,568
3Nov 4, 2025 17:416,00377,169,72247,830,0001,992,0002,285,568
4Nov 4, 2025 17:416,03577,829,95949,086,0001,001,0002,519,040
5Nov 4, 2025 17:416,07677,360,82450,431,00002,285,568
6Nov 4, 2025 17:416,08272,912,21049,475,0001,009,0002,285,568