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 4, 2026 06:13Josu San MartinJosu San MartinScore: 26,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 06:1326,756140,173,085129,828,0001,277,0002,113,536
2Aug 4, 2026 06:1326,762139,344,472130,135,0001,003,0002,113,536
3Aug 4, 2026 06:1326,765139,559,890130,141,0001,011,0002,113,536
4Aug 4, 2026 06:1326,774139,594,984129,933,0001,261,0002,113,536
5Aug 4, 2026 06:1326,782139,427,097130,222,0001,011,0002,113,536
6Aug 4, 2026 06:1326,796139,798,329130,047,0001,257,0002,113,536
7Aug 4, 2026 06:1326,826139,624,233130,178,0001,271,0002,113,536
8Aug 4, 2026 06:1326,840140,012,620130,512,0001,006,0002,113,536
9Aug 4, 2026 06:1327,039141,388,743131,219,0001,275,0002,113,536