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 listAug 6, 2026 20:07LatentSearchLatentSearchScore: 96,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 20:0895,974806,515,543738,102,00058,486,0002,113,536
2Aug 6, 2026 20:0896,003806,687,459738,249,00058,579,0002,113,536
3Aug 6, 2026 20:0896,031808,266,652738,492,00058,571,0002,113,536
4Aug 6, 2026 20:0896,035807,052,335738,634,00058,463,0002,113,536
5Aug 6, 2026 20:0896,038806,904,953738,193,00058,925,0002,113,536
6Aug 6, 2026 20:0896,077807,318,425738,107,00059,337,0002,113,536
7Aug 6, 2026 20:0896,084807,416,741738,428,00059,074,0002,113,536
8Aug 6, 2026 20:0896,093807,451,485738,613,00058,964,0002,113,536
9Aug 6, 2026 20:0896,206808,360,058738,952,00059,563,0002,113,536