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 21, 2026 04:14Andrew EpsteinAndrew EpsteinScore: 3,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 04:143,66940,164,27329,376,0001,083,0002,113,536
2Aug 21, 2026 04:143,74940,998,54230,034,0001,084,0002,113,536
3Aug 21, 2026 04:143,81041,414,47330,544,0001,084,0002,113,536
4Aug 21, 2026 04:143,82341,451,68330,656,0001,083,0002,113,536
5Aug 21, 2026 04:143,85541,911,07930,920,0001,084,0002,113,536
6Aug 21, 2026 04:143,86241,804,52930,986,0001,075,0002,113,536
7Aug 21, 2026 04:143,89042,023,06031,220,0001,072,0002,113,536
8Aug 21, 2026 04:143,90842,189,99231,346,0001,098,0002,113,536
9Aug 21, 2026 04:143,92243,149,89031,467,0001,088,0002,113,536