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 19, 2026 07:56Lan Hoang DaoLan Hoang DaoScore: 79,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 07:5679,805673,228,045603,807,00058,579,0002,113,536
2Aug 19, 2026 07:5679,883673,744,085604,307,00058,722,0002,113,536
3Aug 19, 2026 07:5679,890673,124,677604,727,00058,365,0002,113,536
4Aug 19, 2026 07:5679,949674,348,302604,519,00059,059,0002,113,536
5Aug 19, 2026 07:5679,950674,273,758604,386,00059,203,0002,113,536
6Aug 19, 2026 07:5679,957673,704,836605,521,00058,130,0002,113,536
7Aug 19, 2026 07:5679,961674,513,164604,132,00059,549,0002,113,536
8Aug 19, 2026 07:5679,984674,690,371604,536,00059,334,0002,113,536
9Aug 19, 2026 07:5682,260693,178,825623,422,00059,340,0002,113,536