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 6, 2026 07:47Kevin HeaveyKevin HeaveyScore: 4,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:484,55047,404,53436,752,0001,017,0002,117,632
2Jul 6, 2026 07:484,56147,385,42636,685,0001,173,0002,117,632
3Jul 6, 2026 07:484,58047,574,61936,877,0001,141,0002,117,632
4Jul 6, 2026 07:484,58147,548,25036,866,0001,160,0002,117,632
5Jul 6, 2026 07:484,61847,823,25737,162,0001,170,0002,117,632
6Jul 6, 2026 07:484,62847,974,25437,188,0001,229,0002,117,632
7Jul 6, 2026 07:484,71148,603,84637,889,0001,215,0002,117,632
8Jul 6, 2026 07:484,92350,391,51539,845,0001,017,0002,117,632
9Jul 6, 2026 07:484,92650,410,64839,723,0001,171,0002,117,632