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 listOct 26, 2026 17:40idatsyidatsyScore: 37,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2026 17:4037,230319,820,67178,672,000230,343,0002,117,632
2Oct 26, 2026 17:4037,369321,030,91478,638,000231,531,0002,117,632
3Oct 26, 2026 17:4037,645323,352,68878,903,000233,557,0002,117,632
4Oct 26, 2026 17:4037,679323,673,45279,101,000233,641,0002,117,632
5Oct 26, 2026 17:4037,716323,975,76679,273,000233,777,0002,117,632
6Oct 26, 2026 17:4037,863325,147,90178,598,000235,667,0002,117,632
7Oct 26, 2026 17:4038,173327,739,81280,511,000236,327,0002,117,632
8Oct 26, 2026 17:4038,222328,145,92079,872,000237,377,0002,117,632
9Oct 26, 2026 17:4038,523331,287,55784,802,000234,941,0002,117,632