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 listJul 31, 2026 15:32boop34boop34Score: 14,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 15:3314,149127,348,231115,424,0002,019,0002,121,728
2Jul 31, 2026 15:3314,160127,454,939116,513,0001,017,0002,121,728
3Jul 31, 2026 15:3314,166127,428,396116,567,0001,016,0002,121,728
4Jul 31, 2026 15:3314,170127,528,840115,574,0002,045,0002,121,728
5Jul 31, 2026 15:3314,177127,654,377115,601,0002,074,0002,121,728
6Jul 31, 2026 15:3314,187127,690,018115,685,0002,074,0002,121,728
7Jul 31, 2026 15:3314,192127,734,904116,777,0001,017,0002,121,728
8Jul 31, 2026 15:3314,205127,840,128115,900,0002,009,0002,121,728
9Jul 31, 2026 15:3314,278128,444,612116,494,0002,020,0002,121,728