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 listMay 17, 2026 01:39M-RochatM-RochatScore: 122,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:40119,521596,155,200584,547,0001,106,0002,113,536
2May 17, 2026 01:40121,811606,597,514595,712,0001,165,0002,113,536
3May 17, 2026 01:40122,065606,999,031596,963,0001,158,0002,113,536
4May 17, 2026 01:40122,092609,351,835597,091,0001,162,0002,113,536
5May 17, 2026 01:40122,136607,816,817597,462,0001,007,0002,113,536
6May 17, 2026 01:40122,452608,760,542598,903,0001,113,0002,113,536
7May 17, 2026 01:40122,987612,689,581601,638,0001,001,0002,113,536
8May 17, 2026 01:40123,620618,101,575604,610,0001,128,0002,113,536
9May 17, 2026 01:40123,843617,535,529605,691,0001,144,0002,113,536