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 listMay 11, 2026 11:12wnwnScore: 100,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 11:1399,823497,996,977488,080,0001,055,0002,113,536
2May 11, 2026 11:1399,841497,982,887488,038,0001,184,0002,113,536
3May 11, 2026 11:1399,844500,678,346488,072,0001,168,0002,113,536
4May 11, 2026 11:1399,859498,149,912488,232,0001,081,0002,113,536
5May 11, 2026 11:13100,031498,942,199489,010,0001,144,0002,113,536
6May 11, 2026 11:13100,177499,569,320489,767,0001,102,0002,113,536
7May 11, 2026 11:13101,104504,263,515494,282,0001,129,0002,113,536
8May 11, 2026 11:13101,115506,166,944494,385,0001,081,0002,113,536
9May 11, 2026 11:13101,122504,279,860494,349,0001,151,0002,113,536