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 listAug 27, 2026 17:18Victor MerckléVictor MerckléScore: 4,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:194,68747,984,31937,774,0001,136,0002,117,632stderr
2Aug 27, 2026 17:194,72647,470,74838,152,0001,080,0002,117,632stderr
3Aug 27, 2026 17:194,74247,735,06338,284,0001,077,0002,117,632stderr
4Aug 27, 2026 17:194,74447,675,81938,301,0001,078,0002,117,632stderr
5Aug 27, 2026 17:194,74547,649,89938,294,0001,093,0002,117,632stderr
6Aug 27, 2026 17:194,74848,465,26538,275,0001,140,0002,117,632stderr
7Aug 27, 2026 17:194,74948,523,06138,280,0001,143,0002,117,632stderr
8Aug 27, 2026 17:194,76847,706,41138,560,0001,017,0002,117,632stderr
9Aug 27, 2026 17:194,78249,252,51238,614,0001,082,0002,117,632stderr