Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listSep 11, 2026 14:30Haha ExpertHaha ExpertScore: 203,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 14:32201,418997,160,729869,892,000117,059,00020,480
2Sep 11, 2026 14:32201,422997,174,246870,324,000116,648,00020,480
3Sep 11, 2026 14:32201,507997,718,325870,249,000117,137,00020,480
4Sep 11, 2026 14:32203,4641,007,133,097870,582,000126,395,00020,480
5Sep 11, 2026 14:32203,6271,007,918,819870,509,000127,268,00024,576
6Sep 11, 2026 14:32203,7291,008,443,405870,964,000127,310,00020,480
7Sep 11, 2026 14:32203,9191,009,452,505870,049,000129,156,00020,480
8Sep 11, 2026 14:32203,9641,009,499,968870,009,000129,416,00020,480
9Sep 11, 2026 14:32204,1881,010,795,734871,215,000129,307,00020,480