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 listJan 31, 2026 00:14olliecrowolliecrowScore: 9,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 00:148,16597,784,37466,773,000996,0002,265,088
2Jan 31, 2026 00:148,28499,442,13065,769,0002,989,0002,273,280
3Jan 31, 2026 00:148,32089,726,40864,054,0005,004,0002,498,560
4Jan 31, 2026 00:149,610104,119,57874,781,0004,985,0002,359,296
5Jan 31, 2026 00:149,611106,437,79977,779,0001,994,0002,265,088
6Jan 31, 2026 00:149,627103,020,60877,905,0001,997,0002,367,488
7Jan 31, 2026 00:149,640103,871,99774,014,0006,001,0002,416,640
8Jan 31, 2026 00:149,670102,031,95977,253,0003,009,0002,473,984
9Jan 31, 2026 00:149,707110,561,24675,534,0005,035,0002,494,464
10Jan 31, 2026 00:149,766105,239,88877,052,0004,002,0002,285,568
11Jan 31, 2026 00:149,778107,561,61779,154,0002,003,0002,318,336
12Jan 31, 2026 00:1410,144106,355,68383,196,0001,002,0002,396,160