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 listDec 27, 2025 11:34SinaSinaScore: 110,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 11:34109,958938,578,750686,738,000225,913,0002,457,600
2Dec 27, 2025 11:34110,033942,691,693684,455,000228,818,0002,314,240
3Dec 27, 2025 11:34110,159940,796,026685,489,000228,829,0002,293,760
4Dec 27, 2025 11:34110,356939,672,166686,219,000229,738,0002,445,312
5Dec 27, 2025 11:34110,372942,697,268685,319,000230,770,0002,457,600
6Dec 27, 2025 11:34110,544939,773,696686,635,000230,877,0002,449,408
7Dec 27, 2025 11:34110,561941,893,267685,741,000231,912,0002,453,504
8Dec 27, 2025 11:34110,682941,801,341685,744,000232,913,0002,445,312
9Dec 27, 2025 11:34111,178949,416,810685,835,000236,943,0002,461,696