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 listMar 21, 2026 16:58Dominique GarmierDominique GarmierScore: 171,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 18:45168,967851,235,186826,938,000999,0002,285,568
2Mar 21, 2026 18:45170,349857,963,472833,709,000999,0002,486,272
3Mar 21, 2026 16:58170,749867,838,105834,672,0001,999,0002,433,024
4Mar 21, 2026 18:45171,328868,928,430836,508,0002,998,0002,437,120
5Mar 21, 2026 16:58171,538869,264,554838,537,0001,998,0002,285,568
6Mar 21, 2026 16:58171,896867,135,089840,290,0001,998,0002,428,928