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 21, 2025 18:20Ruoyu QiuRuoyu QiuScore: 618,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 18:20613,8995,124,434,5155,032,409,00062,955,0002,277,376
2Aug 21, 2025 18:20618,9335,163,612,1025,069,193,00067,948,0002,416,640
3Aug 21, 2025 18:20619,2815,165,490,3845,070,088,00069,946,0002,433,024