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 listJul 31, 2026 19:53Josu San MartinJosu San MartinScore: 49,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:5448,855249,361,856238,268,0001,122,0002,113,536
2Jul 31, 2026 19:5448,882250,453,866238,384,0001,138,0002,113,536
3Jul 31, 2026 19:5448,900250,529,701238,480,0001,130,0002,113,536
4Jul 31, 2026 19:5449,158250,963,908239,770,0001,107,0002,113,536
5Jul 31, 2026 19:5449,193251,312,654239,913,0001,134,0002,113,536
6Jul 31, 2026 19:5449,196251,728,862239,940,0001,123,0002,113,536
7Jul 31, 2026 19:5449,515252,796,137241,488,0001,139,0002,113,536
8Jul 31, 2026 19:5449,530253,108,586241,553,0001,146,0002,113,536
9Jul 31, 2026 19:5453,816275,771,120262,577,0001,122,0002,113,536