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 11, 2025 17:01Dmytro IzotovDmytro IzotovScore: 81,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 17:0181,027697,918,912617,563,00054,961,0002,342,912
2Nov 11, 2025 17:0181,056694,156,009605,785,00066,976,0002,338,816
3Nov 11, 2025 17:0181,073698,188,181612,916,00059,991,0002,486,272
4Nov 11, 2025 17:0181,266703,970,027614,551,00059,956,0002,498,560
5Nov 11, 2025 17:0181,759705,152,417618,632,00059,964,0002,486,272
6Nov 11, 2025 17:0181,979710,244,078623,471,00056,951,0002,342,912
7Nov 11, 2025 17:0182,009710,368,185615,707,00064,969,0002,342,912
8Nov 11, 2025 17:0182,113704,924,922620,582,00060,958,0002,342,912
9Nov 11, 2025 17:0182,535706,473,726632,035,00053,002,0002,490,368