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 listJan 18, 2026 01:50Josu San MartinJosu San MartinScore: 203,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 01:40199,4031,006,746,445972,078,0004,995,0002,281,472
2Jan 18, 2026 01:40201,1571,011,434,463981,673,0003,998,0002,269,184
3Jan 18, 2026 01:50201,4531,014,831,164983,123,0003,996,0002,281,472
4Jan 18, 2026 01:50203,3551,024,272,201993,441,0002,998,0002,424,832
5Jan 18, 2026 01:50204,9371,033,608,321999,198,0004,995,0002,347,008
6Jan 18, 2026 01:40211,6511,063,543,8951,032,094,0004,995,0002,281,472