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 listNov 25, 2025 08:33Ham-HamHam-HamScore: 62,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 08:3362,193539,300,443515,202,0001,000,0002,408,448
2Nov 25, 2025 08:3362,232548,878,386514,531,0001,998,0002,273,280
3Nov 25, 2025 08:3362,245551,407,713514,637,0001,998,0002,273,280