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 25, 2026 01:08Victor MerckléVictor MerckléScore: 6,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:096,77864,577,11855,087,0001,178,0002,121,728stderr
2Aug 25, 2026 01:096,77964,600,27755,254,0001,016,0002,121,728stderr
3Aug 25, 2026 01:096,78064,590,19455,270,0001,008,0002,121,728stderr
4Aug 25, 2026 01:096,78165,394,35955,285,0001,004,0002,121,728stderr
5Aug 25, 2026 01:096,78164,510,78355,280,0001,004,0002,121,728stderr
6Aug 25, 2026 01:096,78265,441,13355,270,0001,026,0002,121,728stderr
7Aug 25, 2026 01:096,78464,553,02355,307,0001,008,0002,121,728stderr
8Aug 25, 2026 01:096,78664,690,96755,301,0001,023,0002,121,728stderr
9Aug 25, 2026 01:096,78864,574,64455,343,0001,005,0002,121,728stderr