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 18:42Josu San MartinJosu San MartinScore: 60,859Success
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 18:4260,746307,803,742296,541,0001,117,0002,113,536
2Jul 31, 2026 18:4260,767307,860,138296,640,0001,123,0002,113,536
3Jul 31, 2026 18:4260,767307,890,501296,639,0001,123,0002,113,536
4Jul 31, 2026 18:4260,800308,082,199296,818,0001,105,0002,113,536
5Jul 31, 2026 18:4260,859308,354,684297,096,0001,117,0002,113,536
6Jul 31, 2026 18:4260,953308,767,419297,463,0001,207,0002,113,536
7Jul 31, 2026 18:4261,015309,876,022297,845,0001,132,0002,113,536
8Jul 31, 2026 18:4261,066310,112,893298,111,0001,114,0002,113,536
9Jul 31, 2026 18:4261,147310,492,554298,488,0001,134,0002,113,536