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 25, 2026 00:04Andrew EpsteinAndrew EpsteinScore: 32,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 00:0432,765171,056,092159,439,0001,114,0002,113,536
2Sep 25, 2026 00:0432,770170,977,167159,451,0001,122,0002,113,536
3Sep 25, 2026 00:0432,776171,028,602159,494,0001,109,0002,113,536
4Sep 25, 2026 00:0432,783171,730,764159,534,0001,106,0002,113,536
5Sep 25, 2026 00:0432,788171,319,505159,538,0001,126,0002,113,536
6Sep 25, 2026 00:0432,789171,792,643159,573,0001,096,0002,113,536
7Sep 25, 2026 00:0432,796171,140,489159,595,0001,110,0002,113,536
8Sep 25, 2026 00:0432,804171,906,531159,609,0001,135,0002,113,536
9Sep 25, 2026 00:0432,830172,063,934159,737,0001,130,0002,113,536