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 02:49Andrew EpsteinAndrew EpsteinScore: 3,520Success
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 02:493,41337,110,34727,310,0001,026,0002,113,536
2Sep 17, 2026 02:493,46637,571,81027,745,0001,025,0002,113,536
3Sep 17, 2026 02:493,48037,710,60827,864,0001,023,0002,113,536
4Sep 17, 2026 02:493,48537,708,93127,891,0001,036,0002,113,536
5Sep 17, 2026 02:493,52037,940,08028,182,0001,041,0002,113,536
6Sep 17, 2026 02:493,52838,123,68528,251,0001,037,0002,113,536
7Sep 17, 2026 02:493,53238,177,72228,282,0001,035,0002,113,536
8Sep 17, 2026 02:493,53838,115,90328,340,0001,029,0002,113,536
9Sep 17, 2026 02:493,55938,373,48728,508,0001,037,0002,113,536