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 listSep 17, 2026 16:02Andrew EpsteinAndrew EpsteinScore: 169,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:04168,8441,412,256,5341,399,366,0002,040,0002,117,632stderr
2Sep 17, 2026 16:04168,9491,412,536,2971,401,243,0001,037,0002,117,632stderr
3Sep 17, 2026 16:04168,9531,412,615,4641,401,308,0001,005,0002,117,632stderr
4Sep 17, 2026 16:04168,9591,412,675,5781,401,360,0001,001,0002,117,632stderr
5Sep 17, 2026 16:04169,0601,413,458,1811,400,103,0003,099,0002,117,632stderr
6Sep 17, 2026 16:04169,3741,415,973,8881,404,811,0001,000,0002,117,632stderr
7Sep 17, 2026 16:04169,3841,416,141,3501,404,892,0001,001,0002,117,632stderr
8Sep 17, 2026 16:04169,4351,416,823,4671,405,304,0001,009,0002,117,632stderr
9Sep 17, 2026 16:04169,8701,420,290,0681,408,920,0001,006,0002,117,632stderr