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 14:53Josu San MartinJosu San MartinScore: 25,170Success
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 14:5325,116131,494,259121,806,0001,266,0002,113,536
2Aug 4, 2026 14:5325,124131,606,041121,850,0001,260,0002,113,536
3Aug 4, 2026 14:5325,152131,599,454122,067,0001,178,0002,113,536
4Aug 4, 2026 14:5325,169131,531,730122,065,0001,266,0002,113,536
5Aug 4, 2026 14:5325,170131,682,601122,077,0001,256,0002,113,536
6Aug 4, 2026 14:5325,180131,876,425122,133,0001,252,0002,113,536
7Aug 4, 2026 14:5325,207131,877,825122,264,0001,251,0002,113,536
8Aug 4, 2026 14:5325,468133,213,510123,776,0001,020,0002,113,536
9Aug 4, 2026 14:5326,159138,462,179126,940,0001,242,0002,113,536