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 09:47Andrew EpsteinAndrew EpsteinScore: 60,322Success
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 10:0459,230500,971,587487,150,0004,465,0002,121,728stderr
2Nov 3, 2026 10:0459,441503,152,851488,834,0004,527,0002,121,728stderr
3Nov 3, 2026 10:0459,736505,141,138491,355,0004,457,0002,121,728stderr
4Nov 3, 2026 10:0459,806507,218,077491,529,0004,869,0002,121,728stderr
5Nov 3, 2026 10:0460,322509,977,228496,222,0004,453,0002,121,728stderr
6Nov 3, 2026 10:0460,881515,097,572500,720,0004,599,0002,121,728stderr
7Nov 3, 2026 10:0461,093516,437,419502,613,0004,462,0002,121,728stderr
8Nov 3, 2026 10:0461,492519,830,984505,713,0004,678,0002,121,728stderr
9Nov 3, 2026 10:0462,492528,479,227514,237,0004,454,0002,121,728stderr