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 16, 2026 13:16marko1597marko1597Score: 6,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:396,46364,587,03352,471,0001,176,0002,113,536
2Aug 16, 2026 13:396,46463,544,18152,487,0001,169,0002,113,536
3Aug 16, 2026 13:396,49763,793,27052,921,0001,006,0002,113,536
4Aug 16, 2026 13:396,56064,317,50153,291,0001,165,0002,113,536
5Aug 16, 2026 13:396,57564,416,80153,414,0001,165,0002,113,536
6Aug 16, 2026 13:396,58264,540,75653,458,0001,176,0002,113,536
7Aug 16, 2026 13:396,60464,591,92953,813,0001,007,0002,113,536
8Aug 16, 2026 13:397,06968,625,94257,661,0001,017,0002,113,536
9Aug 16, 2026 13:397,49672,056,43861,052,0001,168,0002,113,536