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 listOct 25, 2026 10:05timothygktimothygkScore: 8,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 10:108,56782,132,06260,072,00011,042,0002,117,632stderr
2Oct 25, 2026 10:108,57384,057,86660,654,00010,504,0002,117,632stderr
3Oct 25, 2026 10:108,58783,369,26560,152,00011,121,0002,117,632stderr
4Oct 25, 2026 10:108,72685,011,91860,789,00011,644,0002,117,632stderr
5Oct 25, 2026 10:108,73383,944,04061,988,00010,503,0002,117,632stderr
6Oct 25, 2026 10:108,86285,040,97862,518,00011,042,0002,117,632stderr
7Oct 25, 2026 10:108,90185,386,13062,095,00011,791,0002,117,632stderr
8Oct 25, 2026 10:108,90285,424,62162,820,00011,068,0002,117,632stderr
9Oct 25, 2026 10:108,95497,477,04662,107,00012,214,0002,117,632stderr