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 listAug 4, 2026 08:32Josu San MartinJosu San MartinScore: 26,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 08:3226,422138,497,307128,216,0001,252,0002,113,536
2Aug 4, 2026 08:3226,425137,539,566128,238,0001,245,0002,113,536
3Aug 4, 2026 08:3226,432137,969,880128,252,0001,267,0002,113,536
4Aug 4, 2026 08:3226,441138,047,331128,293,0001,271,0002,113,536
5Aug 4, 2026 08:3226,444137,993,494128,304,0001,276,0002,113,536
6Aug 4, 2026 08:3226,446138,670,547128,526,0001,062,0002,113,536
7Aug 4, 2026 08:3226,448138,611,356128,322,0001,274,0002,113,536
8Aug 4, 2026 08:3226,450138,055,825128,345,0001,264,0002,113,536
9Aug 4, 2026 08:3227,159141,279,682132,041,0001,039,0002,113,536