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 17, 2026 17:23timothygktimothygkScore: 36,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 17:2436,201311,177,406299,371,0001,102,0002,113,536
2Oct 17, 2026 17:2436,211312,643,916299,374,0001,178,0002,113,536
3Oct 17, 2026 17:2436,212311,233,404299,468,0001,097,0002,113,536
4Oct 17, 2026 17:2436,241311,535,831299,636,0001,168,0002,113,536
5Oct 17, 2026 17:2436,307312,068,190300,239,0001,111,0002,113,536
6Oct 17, 2026 17:2436,312312,136,029300,291,0001,103,0002,113,536
7Oct 17, 2026 17:2436,321312,245,697300,268,0001,197,0002,113,536
8Oct 17, 2026 17:2436,705315,443,665303,545,0001,113,0002,113,536
9Oct 17, 2026 17:2436,863316,745,861304,851,0001,112,0002,113,536