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 11, 2025 16:34Ian MckibbenIan MckibbenScore: 18,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 16:3418,441180,634,689152,064,0001,000,0002,531,328
2Aug 11, 2025 16:3418,448173,056,098151,121,0002,001,0002,433,024
3Aug 11, 2025 16:3418,449181,567,120152,126,0001,000,0002,428,928
4Aug 11, 2025 16:3418,457179,692,161153,192,00002,428,928
5Aug 11, 2025 16:3418,465178,552,873153,258,00002,420,736
6Aug 11, 2025 16:3418,466178,553,543153,271,00002,531,328
7Aug 11, 2025 16:3418,470173,159,990152,301,0001,001,0002,424,832
8Aug 11, 2025 16:3418,473175,366,991152,328,0001,002,0002,531,328
9Aug 11, 2025 16:3418,475181,074,970152,338,0001,002,0002,269,184