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 listOct 16, 2026 21:54janwwwjanwwwScore: 37,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 21:5537,000192,478,038180,227,0001,073,0002,117,632
2Oct 16, 2026 21:5537,003192,444,771180,281,0001,038,0002,117,632
3Oct 16, 2026 21:5537,041192,172,501180,463,0001,041,0002,117,632
4Oct 16, 2026 21:5537,120192,631,363180,840,0001,048,0002,117,632
5Oct 16, 2026 21:5537,441194,117,290182,422,0001,039,0002,117,632
6Oct 16, 2026 21:5537,495194,635,934182,680,0001,049,0002,117,632
7Oct 16, 2026 21:5537,534194,528,930182,865,0001,054,0002,117,632
8Oct 16, 2026 21:5541,030211,613,848199,997,0001,050,0002,117,632
9Oct 16, 2026 21:5598,298492,294,461480,445,0001,217,0002,117,632