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 3, 2026 16:08Josu San MartinJosu San MartinScore: 27,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 16:0827,820145,403,154135,052,0001,267,0002,113,536
2Aug 3, 2026 16:0827,836145,519,986135,393,0001,006,0002,113,536
3Aug 3, 2026 16:0827,846145,173,360135,435,0001,013,0002,113,536
4Aug 3, 2026 16:0827,851145,528,273135,218,0001,255,0002,113,536
5Aug 3, 2026 16:0827,852145,491,340135,208,0001,269,0002,113,536
6Aug 3, 2026 16:0827,873145,613,177135,304,0001,276,0002,113,536
7Aug 3, 2026 16:0827,915145,773,584135,541,0001,247,0002,113,536
8Aug 3, 2026 16:0828,012146,316,986136,243,0001,016,0002,113,536
9Aug 3, 2026 16:0828,568149,164,665138,713,0001,271,0002,113,536