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 12, 2026 03:53Haha ExpertHaha ExpertScore: 156,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 03:53152,991760,869,948748,533,0001,127,0002,113,536
2Sep 12, 2026 03:53155,106771,218,120758,896,0001,128,0002,113,536
3Sep 12, 2026 03:53155,817774,831,601762,370,0001,138,0002,113,536
4Sep 12, 2026 03:53156,151775,568,358764,016,0001,128,0002,113,536
5Sep 12, 2026 03:53156,181775,633,836764,161,0001,128,0002,113,536
6Sep 12, 2026 03:53156,766779,339,762767,028,0001,129,0002,113,536
7Sep 12, 2026 03:53156,769778,521,425767,054,0001,116,0002,113,536
8Sep 12, 2026 03:53156,788778,824,942767,133,0001,130,0002,113,536
9Sep 12, 2026 03:53156,817779,880,676766,242,0002,165,0002,113,536