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 3, 2026 03:42Josu San MartinJosu San MartinScore: 29,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 03:4328,974150,407,541140,713,0001,262,0002,113,536
2Aug 3, 2026 03:4328,980150,422,050140,748,0001,257,0002,113,536
3Aug 3, 2026 03:4328,986150,613,306141,028,0001,007,0002,113,536
4Aug 3, 2026 03:4329,007150,313,349141,134,0001,004,0002,113,536
5Aug 3, 2026 03:4329,013150,728,676140,895,0001,272,0002,113,536
6Aug 3, 2026 03:4329,020150,631,993141,124,0001,076,0002,113,536
7Aug 3, 2026 03:4329,038150,777,967141,272,0001,015,0002,113,536
8Aug 3, 2026 03:4329,042150,757,762141,297,0001,009,0002,113,536
9Aug 3, 2026 03:4329,154151,299,851141,755,0001,100,0002,113,536