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 listJul 31, 2026 20:46Josu San MartinJosu San MartinScore: 38,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 20:4738,457199,374,958187,313,0001,131,0002,113,536
2Jul 31, 2026 20:4738,457199,325,085187,325,0001,115,0002,113,536
3Jul 31, 2026 20:4738,474199,376,906187,390,0001,135,0002,113,536
4Jul 31, 2026 20:4738,474198,609,767187,401,0001,126,0002,113,536
5Jul 31, 2026 20:4738,475199,371,875187,403,0001,126,0002,113,536
6Jul 31, 2026 20:4738,506198,746,903187,425,0001,259,0002,113,536
7Jul 31, 2026 20:4738,507198,885,321187,563,0001,122,0002,113,536
8Jul 31, 2026 20:4738,593199,232,092188,002,0001,105,0002,113,536
9Jul 31, 2026 20:4738,788200,123,505188,962,0001,102,0002,113,536