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 14:44timothygktimothygkScore: 34,377Success
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 14:4434,368295,846,425284,147,0001,110,0002,117,632stderr
2Oct 15, 2026 14:4434,369296,462,993284,184,0001,085,0002,117,632stderr
3Oct 15, 2026 14:4434,374296,514,644284,225,0001,086,0002,117,632stderr
4Oct 15, 2026 14:4434,374296,611,884284,302,0001,006,0002,117,632stderr
5Oct 15, 2026 14:4434,377296,631,606284,214,0001,116,0002,117,632stderr
6Oct 15, 2026 14:4434,381296,069,971284,360,0001,004,0002,117,632stderr
7Oct 15, 2026 14:4434,381295,946,945284,286,0001,082,0002,117,632stderr
8Oct 15, 2026 14:4434,382297,433,368284,268,0001,110,0002,117,632stderr
9Oct 15, 2026 14:4434,384296,594,756284,389,0001,005,0002,117,632stderr