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 listAug 26, 2025 05:28Ashish AhujaAshish AhujaScore: 11,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 05:2811,519125,371,66774,693,00020,914,0002,453,504
2Aug 26, 2025 05:2811,575120,078,32475,275,00020,799,0002,375,680
3Aug 26, 2025 05:2811,586122,532,01374,352,00021,810,0002,367,488
4Aug 26, 2025 05:2811,598127,311,45576,414,00019,847,0002,490,368
5Aug 26, 2025 05:2811,606125,104,46778,451,00017,875,0002,506,752
6Aug 26, 2025 05:2811,639125,905,96077,679,00018,921,0002,375,680