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 07:52Josu San MartinJosu San MartinScore: 26,314Success
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 07:5326,247137,056,871127,347,0001,267,0002,113,536
2Aug 4, 2026 07:5326,276137,219,148127,712,0001,044,0002,113,536
3Aug 4, 2026 07:5326,294137,256,381127,591,0001,252,0002,113,536
4Aug 4, 2026 07:5326,312137,988,986127,669,0001,264,0002,113,536
5Aug 4, 2026 07:5326,314137,084,841127,685,0001,256,0002,113,536
6Aug 4, 2026 07:5326,318137,187,419127,906,0001,055,0002,113,536
7Aug 4, 2026 07:5326,363137,642,632127,921,0001,260,0002,113,536
8Aug 4, 2026 07:5326,367138,253,503127,940,0001,263,0002,113,536
9Aug 4, 2026 07:5326,368137,699,175127,927,0001,277,0002,113,536