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 18, 2025 13:08Ashish AhujaAshish AhujaScore: 11,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0810,837114,719,25581,952,0007,995,0002,273,280
2Aug 18, 2025 13:0810,926114,752,19384,709,0005,979,0002,490,368
3Aug 18, 2025 13:0810,968118,154,49483,031,0008,003,0002,404,352
4Aug 18, 2025 13:0811,011115,686,73586,371,0005,021,0002,449,408
5Aug 18, 2025 13:0811,048127,174,86483,727,0007,974,0002,285,568
6Aug 18, 2025 13:0811,146120,629,02189,525,0002,984,0002,347,008