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 listSep 24, 2026 15:03Andrew EpsteinAndrew EpsteinScore: 252,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:04252,1851,246,900,5451,234,597,0001,111,0002,117,632stderr
2Sep 24, 2026 15:04252,2971,246,807,8151,234,070,0002,187,0002,117,632stderr
3Sep 24, 2026 15:04252,3301,248,318,8521,235,281,0001,139,0002,117,632stderr
4Sep 24, 2026 15:04252,3711,247,876,5771,235,501,0001,120,0002,117,632stderr
5Sep 24, 2026 15:04252,4081,248,163,0461,234,561,0002,240,0002,117,632stderr
6Sep 24, 2026 15:04252,4231,247,591,9861,235,742,0001,133,0002,117,632stderr
7Sep 24, 2026 15:04253,7041,253,782,7331,242,022,0001,131,0002,117,632stderr
8Sep 24, 2026 15:04253,7821,254,374,1701,242,412,0001,122,0002,117,632stderr
9Sep 24, 2026 15:04254,0311,255,237,3461,243,656,0001,098,0002,117,632stderr