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 1, 2026 20:59ambarish1729ambarish1729Score: 11,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 21:0010,776100,482,88784,569,0004,873,00020,480
2Nov 1, 2026 21:0010,798101,004,61884,357,0005,267,0002,113,536
3Nov 1, 2026 21:0011,009102,813,76384,703,0006,674,0002,113,536
4Nov 1, 2026 21:0011,037103,064,88984,985,0006,626,0002,113,536
5Nov 1, 2026 21:0011,131103,819,33184,951,0007,438,00020,480
6Nov 1, 2026 21:0011,136103,896,44385,065,0007,372,00020,480
7Nov 1, 2026 21:0011,145103,448,62484,875,0007,631,00020,480
8Nov 1, 2026 21:0011,187104,393,00685,170,0007,686,00020,480
9Nov 1, 2026 21:0011,256104,919,28485,786,0007,647,0002,113,536