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 11:46timothygktimothygkScore: 8,717Success
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 11:508,53081,854,22560,548,00010,251,0002,117,632stderr
2Oct 25, 2026 11:508,62582,561,01861,127,00010,465,0002,117,632stderr
3Oct 25, 2026 11:508,64983,348,41560,744,00011,045,0002,117,632stderr
4Oct 25, 2026 11:508,70283,705,66861,407,00010,823,0002,117,632stderr
5Oct 25, 2026 11:508,71783,794,30061,371,00010,985,0002,117,632stderr
6Oct 25, 2026 11:508,71983,425,31961,398,00010,973,0002,117,632stderr
7Oct 25, 2026 11:508,76884,253,82461,502,00011,277,0002,117,632stderr
8Oct 25, 2026 11:508,90184,816,21762,948,00010,932,0002,117,632stderr
9Oct 25, 2026 11:509,01386,287,59163,922,00010,890,0002,117,632stderr