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 4, 2026 07:31limanjun99limanjun99Score: 5,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 07:325,35561,727,27542,093,0002,355,0002,498,560
2May 4, 2026 07:325,36761,840,60541,320,0003,231,0002,502,656
3May 4, 2026 07:325,38061,695,21541,376,0003,280,0002,494,464
4May 4, 2026 07:325,38163,979,79741,410,0003,255,0002,494,464
5May 4, 2026 07:325,46162,675,19242,155,0003,172,0002,510,848
6May 4, 2026 07:325,51965,942,27942,492,0003,323,0002,494,464
7May 4, 2026 07:325,53866,070,95242,385,0003,586,0002,510,848
8May 4, 2026 07:325,58562,781,28844,086,0002,276,0002,498,560
9May 4, 2026 07:325,64364,558,51744,483,0002,357,0002,490,368