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 10:59Josu San MartinJosu San MartinScore: 26,095Success
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 10:5926,025135,915,522126,430,0001,096,0002,113,536
2Aug 4, 2026 10:5926,053136,074,485126,623,0001,037,0002,113,536
3Aug 4, 2026 10:5926,066136,114,181126,705,0001,019,0002,113,536
4Aug 4, 2026 10:5926,084136,241,055126,687,0001,128,0002,113,536
5Aug 4, 2026 10:5926,095136,341,292126,779,0001,087,0002,113,536
6Aug 4, 2026 10:5926,116136,456,996126,832,0001,139,0002,113,536
7Aug 4, 2026 10:5926,135136,198,758126,970,0001,093,0002,113,536
8Aug 4, 2026 10:5926,149136,491,037127,036,0001,097,0002,113,536
9Aug 4, 2026 10:5926,551138,540,713128,965,0001,137,0002,113,536