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 listFeb 11, 2026 19:10olliecrowolliecrowScore: 6,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:105,89875,089,68746,958,0001,998,0002,318,336
2Feb 11, 2026 19:105,91179,126,20846,057,0003,003,0002,396,160
3Feb 11, 2026 19:106,12676,393,61846,859,0003,988,0002,457,600
4Feb 11, 2026 19:106,24181,489,52749,809,0001,992,0002,519,040
5Feb 11, 2026 19:106,24378,409,42350,825,000996,0002,314,240
6Feb 11, 2026 19:106,25883,136,04049,947,0001,997,0002,490,368
7Feb 11, 2026 19:106,27680,166,77949,084,0003,005,0002,510,848
8Feb 11, 2026 19:106,29877,482,00350,262,0002,010,0002,293,760
9Feb 11, 2026 19:106,42384,088,90550,296,0003,017,0002,289,664
10Feb 11, 2026 19:106,44981,975,11846,457,0007,069,0002,408,448
11Feb 11, 2026 19:106,53780,952,31048,228,0006,028,0002,367,488
12Feb 11, 2026 19:106,55586,182,63052,389,0002,014,0002,318,336