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 listDec 8, 2025 11:59Jatin GargJatin GargScore: 64,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:5964,339558,810,591532,014,0002,000,0002,285,568
2Dec 8, 2025 11:5964,370564,514,541533,267,0001,000,0002,523,136
3Dec 8, 2025 11:5964,374559,720,844533,304,0001,000,0002,277,376