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 listFeb 3, 2026 12:40RuszrokRuszrokScore: 36,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 12:4036,078326,028,601298,448,0001,001,0002,277,376
2Feb 3, 2026 12:4036,082325,929,991299,480,00002,277,376
3Feb 3, 2026 12:4036,088328,372,162298,528,0001,001,0002,277,376
4Feb 3, 2026 12:4036,091333,914,729299,556,00002,404,352
5Feb 3, 2026 12:4036,706327,962,772302,665,0001,997,0002,396,160
6Feb 3, 2026 12:4036,711335,022,709303,699,000999,0002,396,160
7Feb 3, 2026 12:4036,711331,785,495303,703,000999,0002,277,376
8Feb 3, 2026 12:4036,721326,974,322303,785,000999,0002,277,376
9Feb 3, 2026 12:4036,721326,167,748302,786,0001,998,0002,392,064