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 30, 2025 08:26SinaSinaScore: 111,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 08:26111,400953,842,493701,714,000222,909,0002,277,376
2Nov 30, 2025 08:26111,640947,641,182700,708,000225,905,0002,449,408
3Nov 30, 2025 08:26111,717956,477,539701,434,000225,817,0002,301,952
4Nov 30, 2025 08:26111,741948,443,506701,586,000225,866,0002,285,568
5Nov 30, 2025 08:26111,820953,219,209700,327,000227,781,0002,478,080
6Nov 30, 2025 08:26111,845956,461,278701,483,000226,832,0002,375,680
7Nov 30, 2025 08:26111,852951,836,261700,523,000227,845,0002,453,504
8Nov 30, 2025 08:26111,853954,659,157701,533,000226,849,0002,449,408
9Nov 30, 2025 08:26112,070960,656,385701,385,000228,799,0002,322,432