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 9, 2025 07:37izotoffizotoffScore: 59,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 07:3759,110516,575,512487,612,0002,997,0002,543,616
2Nov 9, 2025 07:3759,305519,022,158492,230,00002,539,520
3Nov 9, 2025 07:3759,321521,115,649489,364,0003,002,0002,351,104
4Nov 9, 2025 07:3759,325522,939,144491,397,0001,000,0002,539,520
5Nov 9, 2025 07:3759,326518,559,254492,405,00002,514,944
6Nov 9, 2025 07:3759,341517,300,868490,530,0002,002,0002,506,752