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 listOct 15, 2026 13:44timothygktimothygkScore: 37,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 13:4537,519322,726,762310,342,0001,071,0002,117,632stderr
2Oct 15, 2026 13:4537,531322,736,034310,426,0001,089,0002,117,632stderr
3Oct 15, 2026 13:4537,537322,065,724310,484,0001,080,0002,117,632stderr
4Oct 15, 2026 13:4537,585324,235,144310,876,0001,086,0002,117,632stderr
5Oct 15, 2026 13:4537,588322,533,070310,918,0001,065,0002,117,632stderr
6Oct 15, 2026 13:4537,990325,944,123314,306,0001,011,0002,117,632stderr
7Oct 15, 2026 13:4537,995326,568,064314,252,0001,110,0002,117,632stderr
8Oct 15, 2026 13:4538,350329,682,079317,308,0001,003,0002,117,632stderr
9Oct 15, 2026 13:4538,442329,731,000318,072,0001,003,0002,117,632stderr