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 11:59Josu San MartinJosu San MartinScore: 28,802Success
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 11:5928,782151,117,068139,771,0001,265,0002,113,536
2Aug 3, 2026 11:5928,785150,175,022139,780,0001,269,0002,113,536
3Aug 3, 2026 11:5928,786149,484,756139,796,0001,257,0002,113,536
4Aug 3, 2026 11:5928,787149,509,397139,801,0001,260,0002,113,536
5Aug 3, 2026 11:5928,802150,326,270140,130,0001,004,0002,113,536
6Aug 3, 2026 11:5928,810149,686,665139,897,0001,276,0002,113,536
7Aug 3, 2026 11:5928,822150,294,126139,964,0001,265,0002,113,536
8Aug 3, 2026 11:5928,887150,612,402140,430,0001,118,0002,113,536
9Aug 3, 2026 11:5929,343152,120,862142,536,0001,249,0002,113,536