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 listJan 21, 2026 03:09Josu San MartinJosu San MartinScore: 115,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2026 03:09115,166589,321,833560,313,0004,002,0002,465,792
2Jan 21, 2026 03:09115,173593,026,185559,352,0004,994,0002,281,472
3Jan 21, 2026 03:09115,218594,216,949558,575,0005,995,0002,281,472
4Jan 21, 2026 03:09115,315588,775,244561,043,0004,000,0002,314,240
5Jan 21, 2026 03:09115,494593,404,431560,922,0004,999,0002,281,472
6Jan 21, 2026 03:09115,618592,038,356562,530,0003,996,0002,465,792
7Jan 21, 2026 03:09115,646597,764,714563,665,0002,998,0002,281,472
8Jan 21, 2026 03:09115,809595,405,903560,472,0006,993,0002,281,472
9Jan 21, 2026 03:09116,507604,658,000567,884,0002,999,0002,461,696