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 10:59wnwnScore: 98,495Success
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:0198,419491,804,430480,200,0002,056,0002,113,536
2May 11, 2026 11:0198,427491,158,905480,269,0002,026,0002,113,536
3May 11, 2026 11:0198,428492,214,235480,282,0002,018,0002,113,536
4May 11, 2026 11:0198,488492,813,646480,586,0002,007,0002,113,536
5May 11, 2026 11:0198,495494,131,151480,529,0002,101,0002,113,536
6May 11, 2026 11:0198,853494,846,625481,360,0003,021,0002,113,536
7May 11, 2026 11:0198,985493,813,535483,021,0002,006,0002,113,536
8May 11, 2026 11:0198,998496,854,649483,069,0002,026,0002,113,536
9May 11, 2026 11:0199,104494,946,881484,606,0001,004,0002,113,536