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 listJan 11, 2026 15:42Pavel SkripkinPavel SkripkinScore: 34,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 15:4234,519317,497,912285,507,0001,001,0002,277,376
2Jan 11, 2026 15:4234,542311,862,926286,700,00002,543,616
3Jan 11, 2026 15:4234,581306,431,931285,024,0002,000,0002,543,616
4Jan 11, 2026 15:4234,609314,992,810286,257,0001,000,0002,437,120
5Jan 11, 2026 15:4234,609308,270,975286,257,0001,000,0002,543,616
6Jan 11, 2026 15:4234,610310,759,781286,261,0001,000,0002,437,120
7Jan 11, 2026 15:4234,618314,305,491286,327,0001,001,0002,281,472
8Jan 11, 2026 15:4234,635318,157,027286,473,0001,001,0002,543,616
9Jan 11, 2026 15:4234,635314,565,615286,470,0001,001,0002,281,472