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 listFeb 11, 2026 18:31olliecrowolliecrowScore: 6,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:315,89979,958,55145,966,0002,997,0002,482,176
2Feb 11, 2026 18:315,91675,749,72342,090,0007,015,0002,482,176
3Feb 11, 2026 18:315,96980,634,71345,497,0004,044,0002,396,160
4Feb 11, 2026 18:316,32781,240,28751,502,0001,009,0002,375,680
5Feb 11, 2026 18:316,36881,655,10747,870,0004,986,0002,322,432
6Feb 11, 2026 18:316,42281,170,25750,283,0003,016,0002,408,448