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 3, 2025 16:29prashantbits01prashantbits01Score: 1,268,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 16:291,264,20410,523,292,89310,425,932,00066,961,0002,277,376
2Nov 3, 2025 16:291,264,36010,525,680,73310,422,223,00071,967,0002,277,376
3Nov 3, 2025 16:291,264,43010,530,856,82310,423,801,00070,964,0002,277,376
4Nov 3, 2025 16:291,264,70410,526,733,47210,435,075,00061,970,0002,285,568
5Nov 3, 2025 16:291,268,09810,553,278,62510,454,251,00070,960,0002,355,200
6Nov 3, 2025 16:291,268,43310,557,062,15210,463,029,00064,969,0002,285,568
7Nov 3, 2025 16:291,268,84610,561,104,00510,469,456,00061,967,0002,277,376
8Nov 3, 2025 16:291,272,63910,600,991,94210,487,945,00074,956,0002,277,376
9Nov 3, 2025 16:291,274,72310,610,836,83410,492,253,00087,951,0002,281,472