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 8, 2025 20:30Ashish AhujaAshish AhujaScore: 2,701,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 20:302,699,65428,198,971,61620,440,995,0001,966,133,0002,416,640
2Aug 8, 2025 20:302,701,00228,323,758,26320,480,471,0001,937,842,0002,494,464
3Aug 8, 2025 20:302,703,43728,160,336,84320,427,111,0002,011,420,0002,273,280