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 listJun 7, 2025 05:33limanjun99limanjun99Score: 53,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2025 05:3353,709471,345,152382,816,00062,969,0002,383,872
2Jun 7, 2025 05:3353,746470,974,952369,074,00077,015,0002,371,584
3Jun 7, 2025 05:3353,780472,887,592378,318,00068,057,0002,506,752
4Jun 7, 2025 05:3353,809480,012,772396,657,00049,956,0002,256,896
5Jun 7, 2025 05:3353,811475,879,084387,679,00058,951,0002,392,064
6Jun 7, 2025 05:3353,892479,569,471366,251,00081,055,0002,519,040
7Jun 7, 2025 05:3353,897467,255,567381,292,00066,050,0002,383,872
8Jun 7, 2025 05:3353,966476,100,901361,934,00085,984,0002,260,992
9Jun 7, 2025 05:3354,701475,918,605388,015,00066,002,0002,260,992