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 20, 2026 11:07Dominique GarmierDominique GarmierScore: 390,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 11:07390,5001,940,296,5561,912,449,000999,0002,392,064
2Mar 20, 2026 11:07390,5941,944,527,1391,912,911,000999,0002,273,280
3Mar 20, 2026 11:07390,6601,947,922,0651,912,237,0001,998,0002,269,184