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 24, 2026 15:31Andrew EpsteinAndrew EpsteinScore: 39,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:3239,810205,342,599193,925,0001,145,0002,113,536
2Sep 24, 2026 15:3239,865205,601,131194,110,0001,233,0002,113,536
3Sep 24, 2026 15:3239,867205,680,702194,348,0001,005,0002,113,536
4Sep 24, 2026 15:3239,872205,732,324194,138,0001,237,0002,113,536
5Sep 24, 2026 15:3239,881205,607,834194,171,0001,249,0002,113,536
6Sep 24, 2026 15:3239,895206,391,626194,259,0001,230,0002,113,536
7Sep 24, 2026 15:3239,896205,836,145194,269,0001,223,0002,113,536
8Sep 24, 2026 15:3239,959206,121,450194,567,0001,233,0002,113,536
9Sep 24, 2026 15:3241,323212,708,373201,268,0001,215,0002,113,536