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 09:06Josu San MartinJosu San MartinScore: 26,104Success
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 09:0726,038136,021,323126,321,0001,266,0002,113,536
2Aug 4, 2026 09:0726,047136,090,727126,379,0001,255,0002,113,536
3Aug 4, 2026 09:0726,050136,023,278126,644,0001,003,0002,113,536
4Aug 4, 2026 09:0726,089136,872,688126,579,0001,260,0002,113,536
5Aug 4, 2026 09:0726,104137,688,240126,905,0001,007,0002,113,536
6Aug 4, 2026 09:0726,107136,426,125126,850,0001,079,0002,113,536
7Aug 4, 2026 09:0726,110136,139,282126,666,0001,275,0002,113,536
8Aug 4, 2026 09:0726,123136,476,848126,750,0001,257,0002,113,536
9Aug 4, 2026 09:0726,130136,481,480126,864,0001,174,0002,113,536