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 listMay 19, 2026 19:49Maya RebholzMaya RebholzScore: 22,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 19:5022,558198,297,750121,065,00066,174,0002,113,536
2May 19, 2026 19:5022,559199,140,186121,352,00065,893,0002,113,536
3May 19, 2026 19:5022,567200,831,273121,223,00066,086,0002,113,536
4May 19, 2026 19:5022,574198,796,097121,233,00066,133,0002,113,536
5May 19, 2026 19:5022,596197,025,606121,338,00066,214,0002,113,536
6May 19, 2026 19:5022,618197,637,579121,093,00066,638,0002,113,536
7May 19, 2026 19:5022,622199,678,702121,322,00066,441,0002,113,536
8May 19, 2026 19:5022,655198,612,864121,166,00066,875,0002,113,536
9May 19, 2026 19:5022,887201,459,337123,030,00066,935,0002,113,536