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 listNov 1, 2026 06:36Md Nafis Ul Haque ShifatMd Nafis Ul Haque ShifatScore: 6,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 06:376,46364,394,26450,528,0003,121,0002,113,536
2Nov 1, 2026 06:376,48664,477,23450,755,0003,079,0002,113,536
3Nov 1, 2026 06:376,51764,734,98752,023,0002,072,0002,113,536
4Nov 1, 2026 06:376,52566,247,80351,100,0003,061,0002,113,536
5Nov 1, 2026 06:376,53864,923,17551,132,0003,135,0002,113,536
6Nov 1, 2026 06:376,55765,654,25951,371,0003,055,0002,113,536
7Nov 1, 2026 06:376,57865,294,45751,352,0003,248,0002,113,536
8Nov 1, 2026 06:376,58865,338,05651,550,0003,132,0002,113,536
9Nov 1, 2026 06:376,60765,506,62751,672,0003,174,0002,113,536