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 1, 2026 11:24Josu San MartinJosu San MartinScore: 35,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 11:2535,836185,774,563174,475,0001,123,0002,113,536
2Aug 1, 2026 11:2535,838185,732,225174,502,0001,105,0002,113,536
3Aug 1, 2026 11:2535,839187,208,280174,518,0001,097,0002,113,536
4Aug 1, 2026 11:2535,845185,778,863174,516,0001,126,0002,113,536
5Aug 1, 2026 11:2535,850186,720,163174,529,0001,138,0002,113,536
6Aug 1, 2026 11:2535,860185,805,237174,603,0001,114,0002,113,536
7Aug 1, 2026 11:2535,862186,634,844174,598,0001,126,0002,113,536
8Aug 1, 2026 11:2535,863185,854,952174,609,0001,122,0002,113,536
9Aug 1, 2026 11:2535,865185,796,026174,628,0001,112,0002,113,536