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, 2026 06:45Andrew EpsteinAndrew EpsteinScore: 9,911Success
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, 2026 06:459,82290,813,35480,522,0001,006,00024,576stderr
2Nov 3, 2026 06:459,84390,963,77880,537,0001,166,0002,117,632stderr
3Nov 3, 2026 06:459,87791,229,16980,846,0001,141,0002,117,632stderr
4Nov 3, 2026 06:459,88191,383,79280,994,0001,021,00024,576stderr
5Nov 3, 2026 06:459,91191,567,02181,248,0001,021,00024,576stderr
6Nov 3, 2026 06:459,92991,725,65481,401,0001,010,00024,576stderr
7Nov 3, 2026 06:459,94091,801,69381,498,0001,006,00024,576stderr
8Nov 3, 2026 06:459,94391,842,38881,388,0001,142,0002,117,632stderr
9Nov 3, 2026 06:459,95491,930,45681,486,0001,136,0002,117,632stderr