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 listApr 26, 2026 15:20wnwnScore: 3,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:213,41044,319,52327,294,0001,010,0002,330,624
2Apr 26, 2026 15:213,42347,039,19027,399,0001,014,0002,486,272
3Apr 26, 2026 15:213,47140,969,36726,828,0001,987,0002,490,368
4Apr 26, 2026 15:213,47744,911,13026,872,0001,990,0002,482,176
5Apr 26, 2026 15:213,47843,180,56826,881,0001,991,0002,330,624
6Apr 26, 2026 15:213,48145,705,03126,905,0001,992,0002,486,272
7Apr 26, 2026 15:213,52247,739,88228,232,0001,008,0002,486,272
8Apr 26, 2026 15:213,61543,495,84728,008,0002,000,0002,486,272
9Apr 26, 2026 15:213,65147,896,64529,298,0001,010,0002,490,368