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 listMar 19, 2026 06:40Dominique GarmierDominique GarmierScore: 156,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 02:44154,968784,594,297755,346,0003,996,0002,506,752
2Mar 19, 2026 02:44156,169790,560,008760,232,0004,994,0002,326,528
3Mar 19, 2026 02:44156,784797,437,335764,248,0003,996,0002,297,856
4Mar 19, 2026 06:40156,890795,189,873765,762,0002,999,0002,510,848
5Mar 19, 2026 06:40157,407797,497,903768,297,0002,997,0002,514,944
6Mar 19, 2026 06:40157,569799,006,076769,091,0002,996,0002,514,944