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 31, 2026 00:41Josu San MartinJosu San MartinScore: 4,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 00:504,85048,652,44939,234,0001,025,0002,113,536
2Aug 31, 2026 00:504,85848,761,46739,286,0001,039,0002,113,536
3Aug 31, 2026 00:504,87549,000,08939,417,0001,049,0002,113,536
4Aug 31, 2026 00:504,87648,900,99939,360,0001,116,0002,113,536
5Aug 31, 2026 00:504,87948,919,97139,391,0001,105,0002,113,536
6Aug 31, 2026 00:504,89049,050,78639,471,0001,117,0002,113,536
7Aug 31, 2026 00:504,89149,007,43639,586,0001,016,0002,113,536
8Aug 31, 2026 00:504,89449,136,81839,597,0001,031,0002,113,536
9Aug 31, 2026 00:504,91758,394,30839,786,0001,031,0002,113,536