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 12, 2025 06:31Gunsoo KimGunsoo KimScore: 2,065,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 06:312,061,18217,137,973,38917,037,847,00069,966,0002,277,376
2Nov 12, 2025 06:312,063,52117,163,635,13017,062,261,00064,962,0002,519,040
3Nov 12, 2025 06:312,064,24617,168,713,96717,047,287,00085,951,0002,289,664
4Nov 12, 2025 06:312,065,02317,172,903,84317,072,722,00066,967,0002,277,376
5Nov 12, 2025 06:312,065,87317,177,469,07717,088,771,00057,972,0002,277,376
6Nov 12, 2025 06:312,065,97317,182,870,33317,079,617,00067,962,0002,285,568
7Nov 12, 2025 06:312,066,13617,177,497,40317,085,957,00062,970,0002,277,376
8Nov 12, 2025 06:312,067,44017,204,547,87017,096,782,00062,966,0002,260,992
9Nov 12, 2025 06:312,069,06617,205,623,96417,110,284,00062,960,0002,289,664