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 3, 2026 07:32Andrew EpsteinAndrew EpsteinScore: 85,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 07:3484,725713,064,376701,164,0002,057,0002,121,728stderr
2Nov 3, 2026 07:3484,735712,591,771701,276,0002,032,0002,121,728stderr
3Nov 3, 2026 07:3484,853713,519,057701,254,0003,032,0002,121,728stderr
4Nov 3, 2026 07:3484,987714,769,740703,383,0002,014,0002,121,728stderr
5Nov 3, 2026 07:3485,070715,739,177704,038,0002,051,0002,121,728stderr
6Nov 3, 2026 07:3485,083715,290,084703,141,0003,050,0002,121,728stderr
7Nov 3, 2026 07:3485,122716,313,982704,476,0002,038,0002,121,728stderr
8Nov 3, 2026 07:3485,196716,497,825704,062,0003,070,0002,121,728stderr
9Nov 3, 2026 07:3485,298717,298,310704,925,0003,051,0002,121,728stderr