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 listJun 24, 2026 23:35Victor MerckléVictor MerckléScore: 4,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:364,18142,255,59533,638,0001,068,0002,113,536
2Jun 24, 2026 23:364,19242,328,73533,713,0001,086,0002,113,536
3Jun 24, 2026 23:364,20642,810,14933,878,0001,037,0002,113,536
4Jun 24, 2026 23:364,21342,948,62333,871,0001,102,0002,113,536
5Jun 24, 2026 23:364,21843,071,68433,883,0001,130,0002,113,536
6Jun 24, 2026 23:364,24142,885,48834,180,0001,022,0002,113,536
7Jun 24, 2026 23:364,29843,252,52034,593,0001,087,0002,113,536
8Jun 24, 2026 23:364,32843,562,01534,844,0001,084,0002,113,536
9Jun 24, 2026 23:364,38144,351,65435,349,0001,016,0002,113,536