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 25, 2026 23:25Victor MerckléVictor MerckléScore: 4,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 23:274,90948,463,52939,649,0001,101,0002,113,536
2Jun 25, 2026 23:274,93048,485,50839,891,0001,036,0002,113,536
3Jun 25, 2026 23:274,93348,624,52839,871,0001,080,0002,113,536
4Jun 25, 2026 23:274,94048,688,27239,931,0001,079,0002,113,536
5Jun 25, 2026 23:274,94948,743,31540,062,0001,018,0002,113,536
6Jun 25, 2026 23:274,95548,816,13540,044,0001,090,0002,113,536
7Jun 25, 2026 23:274,96048,868,28140,078,0001,092,0002,113,536
8Jun 25, 2026 23:274,96448,860,86640,183,0001,022,0002,113,536
9Jun 25, 2026 23:275,13752,079,03641,629,0001,010,0002,113,536