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 22, 2026 15:34timothygktimothygkScore: 24,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 15:3424,352213,064,749149,017,00053,109,0002,121,728stderr
2Oct 22, 2026 15:3424,352213,036,556149,433,00052,696,0002,117,632stderr
3Oct 22, 2026 15:3424,417214,333,432149,822,00052,840,0002,117,632stderr
4Oct 22, 2026 15:3424,432213,695,977149,624,00053,168,0002,117,632stderr
5Oct 22, 2026 15:3424,432213,664,269149,076,00053,715,0002,117,632stderr
6Oct 22, 2026 15:3424,526215,123,894149,260,00054,306,0002,117,632stderr
7Oct 22, 2026 15:3424,527215,223,726149,316,00054,261,0002,117,632stderr
8Oct 22, 2026 15:3424,624215,454,338150,159,00054,221,0002,117,632stderr
9Oct 22, 2026 15:3424,664216,141,827149,640,00055,076,0002,117,632stderr